Simulation of Turing machines by a regular rewrite rule
Author:
- Max DauchetMDMax Dauchet
- 14 September 1992
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 103 (2) , 409-420
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programmingTheoretical Computer Science, 1990
- EditorialJournal of Symbolic Computation, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Thue systems as rewriting systemsJournal of Symbolic Computation, 1987