A finite thue system with decidable word problem and without equivalent finite canonical system
- 31 December 1985
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 35, 337-344
- https://doi.org/10.1016/0304-3975(85)90023-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Finite complete rewriting systems for the Jantzen monoid and the greendlinger groupTheoretical Computer Science, 1984
- On Proving Uniform Termination and Restricted Termination of Rewriting SystemsSIAM Journal on Computing, 1983
- 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