An O(|T|3) algorithm for testing the Church-Rosser property of thue systems
- 31 December 1985
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 35, 109-114
- https://doi.org/10.1016/0304-3975(85)90008-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On Proving Uniform Termination and Restricted Termination of Rewriting SystemsSIAM Journal on Computing, 1983
- ProblemsJournal of Algorithms, 1982
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Testing for the Church-Rosser propertyTheoretical Computer Science, 1981
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Efficient string matchingCommunications of the ACM, 1975