A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7581 LNCS, Issue , 2013, Pages 29-43

  Morita, Kenichi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

garbage less computation; multi head finite automaton; reversible computing; reversible Turing machine

Indexed keywords

MACHINERY; ROBOTS;

CONVERSION METHODS; FINITE NUMBER; FINITE STATE CONTROL; REVERSIBLE COMPUTING; REVERSIBLE TURING MACHINES; TWO DIRECTIONS; TWO WAYS;

TURING MACHINES;

EID: 84872876419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36315-3_3     Document Type: Conference Paper

References (8)

1. Axelsen, H.: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space. In: Dediu, A.-H.,Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 95-105. Springer, Heidelberg (2012)
2. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525-532 (1973)
3. Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In: Proc. IEEE Symp. on Switching and Automata Theory, pp. 155-160. IEEE (1967)
4. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoret. Comput. Sci. 412, 83-96 (2011)
5. Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. 36th FOCS, pp. 66-75. IEEE (1997)
6. Lange, K.J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60, 354-367 (2000) (Pubitemid 30586913)
7. Morita, K.: Two-way reversible multi-head finite automata. Fundamenta Informaticae 110, 241-254 (2011)
8. Sipser, M.: Halting space-bounded computations. Theoret. Comput. Sci. 10, 335-338 (1980)