Two-way reversible multi-head finite automata

Fundamenta Informaticae

Volumn 110, Issue 1-4, 2011, Pages 241-254

  Morita, Kenichi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

language recognition; multi head finite automaton; reversible computing

Indexed keywords

CONSTRUCTION METHOD; LANGUAGE RECOGNITION; PRIME NUMBER; REVERSIBLE COMPUTING;

COMPUTATION THEORY; CONTEXT FREE LANGUAGES; FINITE AUTOMATA;

CONTEXT SENSITIVE LANGUAGES;

EID: 80052813492     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2011-541     Document Type: Article

References (15)

1. Bennett, C. H.: Logical reversibility of computation, IBM J. Res. Dev., 17, 1973, 525-532.
2. Fredkin, E., Toffoli, T.: Conservative logic, Int. J. Theoret. Phys., 21, 1982, 219-253.
3. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions, Theoret. Comput. Sci., 412, 2011, 83-96.
4. Ibarra, O.: On two-way multihead automata, J. Comput. Syst. Sci., 7, 1973, 28-36.
5. Kutrib, M., Malcher, A.: Reversible pushdown automata, Proc. LATA 2010, LNCS 6031, Springer-Verlag, 2010, 368-379.
6. Lange, K.-J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space, J. Comput. Syst. Sci., 60, 2000, 354-367. (Pubitemid 30586913)
7. nu, oú θ est un isomorphisme de codes, Comptes Rendus Hebdomadaires des Séances de L'académie des Sciences, 257, 1963, 2597-2600.
8. Monien, B.: Transformational methods and their application to complexity theory, Acta Inform., 6, 1976, 95-108.
9. Morita, K.: Universality of a reversible two-counter machine, Theoret. Comput. Sci., 168, 1996, 303-320. (Pubitemid 126412043)
10. Morita, K.: Reversible computing and cellular automata - A survey, Theoret. Comput. Sci., 395, 2008, 101-131.
11. Morita, K.: Constructing a reversible Turing machine by a rotary element, a reversible logic element with memory, Hiroshima University Institutional Repository, http://ir.lib.hiroshima-u.ac.jp/00029224, 2010.
12. Rabin, M., Scott, D.: Finite automata and their decision problems, IBM J. Res. Dev., 3, 1959, 114-125.
13. Rosenberg, A.: On multi-head finite automata, IBM J. Res. Dev., 10, 1966, 388-394.
14. Toffoli, T.: Computation and construction universality of reversible cellular automata, J. Comput. Syst. Sci., 15, 1977, 213-231.
15. Toffoli, T.: Reversible computing, Automata, Languages and Programming, LNCS 85, Springer-Verlag, 1980, 632-644.