The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems-Reference-Cited by-同舟云学术

The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems

Published:1992-12 Issue:4 Volume:25 Page:241-251
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Otto Friedrich

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01213858.pdf

Reference18 articles.

1. B. Benninghofen, S. Kemmerich, M. M. Richter,Systems of Reductions, Lecture Notes in Computer Science, Vol. 277, Springer-Verlag, Berlin, 1987.

2. R. V. Book, Confluent and other types of Thue systems,Journal of the Association for Computing Machinery 29 (1982), 171?182.

3. R. V. Book, Decidable sentences of Church-Rosser congruences,Theoretical Computer Science 23 (1983), 301?312.

4. R. V. Book, Thue systems as rewriting systems,Journal of Symbolic Computation 3 (1987), 39?68.

5. R. V. Book, C. O'Dunlaing, Testing for the Church-Rosser property,Theoretical Computer Science 16 (1981), 223?229.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lambda-confluence for context rewriting systems;Theoretical Computer Science;2015-05

2. Some Applications of the Decidability of DPDA’s Equivalence;Lecture Notes in Computer Science;2001

3. A Survey on the Computational Power of Some Classes of Finite Monoid Presentations;Algorithmic Problems in Groups and Semigroups;2000

4. On the Connections between Rewriting and Formal Language Theory;Rewriting Techniques and Applications;1999

5. A polynomial algorithm testing partial confluence of basic semi-Thue systems;Theoretical Computer Science;1998-02