Simulation of Turing machines by a left-linear rewrite rule
- 1 January 1989
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Termination of rewriting is undecidable in the one-rvle casePublished by Springer Nature ,2005
- Termination of rewritingJournal of Symbolic Computation, 1987
- Thue systems as rewriting systemsJournal of Symbolic Computation, 1987
- EditorialJournal of Symbolic Computation, 1987
- Weighted graphs : A tool for logic programmingPublished by Springer Nature ,1986
- Construction d'un plus petit ordre de simplificationRAIRO. Informatique théorique, 1984
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980