Decidable sentences of Church-Rosser congruences
- 31 August 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 24 (3) , 301-312
- https://doi.org/10.1016/0304-3975(83)90005-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Monadic Thue systemsTheoretical Computer Science, 1982
- When is a monoid a group? the Church-Rosser case is tractableTheoretical Computer Science, 1982
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Testing for the Church-Rosser propertyTheoretical Computer Science, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- On the equivalence, containment, and covering problems for the regular and context-free languagesJournal of Computer and System Sciences, 1976
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Une Generalisation des Ensembles de DyckIsrael Journal of Mathematics, 1971