Reversible Limited Automata
- 30 August 2015
- book chapter
- Published by Springer Nature
- p. 113-128
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Fast reversible language recognition using cellular automataInformation and Computation, 2008
- Reversible computing and cellular automata—A surveyTheoretical Computer Science, 2008
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languagesInformation and Computation, 2005
- Reversible Space Equals Deterministic SpaceJournal of Computer and System Sciences, 2000
- Growing Context-Sensitive Languages and Church–Rosser LanguagesInformation and Computation, 1998
- Church-Rosser Thue systems and formal languagesJournal of the ACM, 1988
- Inference of Reversible LanguagesJournal of the ACM, 1982
- Computational Complexity of One-Tape Turing Machine ComputationsJournal of the ACM, 1968
- A generalization of context-free determinismInformation and Control, 1967
- One-tape, off-line Turing machine computationsInformation and Control, 1965