The power of the Church-Rosser property for string rewriting systems
- 5 October 2005
- book chapter
- Published by Springer Nature
- p. 360-368
- https://doi.org/10.1007/bfb0000070
Abstract
No abstract availableKeywords
This publication has 14 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
- On a special monoid with a single defining relationTheoretical 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
- 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
- On some families of languages related to the Dyck languagePublished by Association for Computing Machinery (ACM) ,1970