n-level rewriting systems
Open Access
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 40, 85-99
- https://doi.org/10.1016/0304-3975(85)90160-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A finite thue system with decidable word problem and without equivalent finite canonical systemTheoretical Computer Science, 1985
- A note on a special one-rule semi-Thue systemInformation Processing Letters, 1985
- Finite complete rewriting systems and the complexity of the word problemActa Informatica, 1984
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980