Reversible multi-head finite automata characterize reversible logarithmic space

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

Volumn 7183 LNCS, Issue , 2012, Pages 95-105

  Axelsen, Holger Bock ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

REVERSIBLE TURING MACHINES; SPACE COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

TURING MACHINES;

EID: 84857811507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28332-1_9     Document Type: Conference Paper

References (14)

1. Axelsen, H.B.: Time Complexity of Tape Reduction for Reversible Turing Machines. In: De Vos, A., Wille, R. (eds.) RC 2011. LNCS, vol. 7165, Springer, Heidelberg (2012)
2. Axelsen, H.B., Glück, R.: A Simple and Efficient Universal Reversible Turing Machine. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 117-128. Springer, Heidelberg (2011)
3. Axelsen, H.B., Glück, R.: What Do Reversible Programs Compute? In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 42-56. Springer, Heidelberg (2011)
4. Bennett, C.H.: Logical reversibility of computation. IBM Journal of Research and Development 17(6), 525-532 (1973)
5. Hartmanis, J.: On non-determinancy in simple computing devices. Acta Informatica 1(4), 336-344 (1972)
6. Holzer, M., Kutrib,M., Malcher, A.: Multi-head finite automata: Characterizations, concepts and open problems. In: Neary, T., Woods, D., Seda, A.K., Murphy, N. (eds.) Complexity of Simple Programs. EPTCS, vol. 1, pp. 93-107 (2008)
7. Ibarra, O.H.: On two-way multihead automata. J. Comput. and Sys. Sci. 7(1), 28-36 (1973)
8. Kutrib, M., Malcher, A.: Reversible Pushdown Automata. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 368-379. Springer, Heidelberg (2010)
9. Lange, K.-J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. and Sys. Sci. 60(2), 354-367 (2000)
10. Morita, K.: Reversible multi-head finite automata and languages accepted by them (extended abstract). In: Wille, R., De Vos, A. (eds.) Proceedings of the 3rd Workshop on Reversible Computation, pp. 25-30. Universiteit Gent (2011)
11. Morita, K.: Two-way reversible multi-head finite automata. Fundamenta Informaticae 110(1-4), 241-254 (2011)
12. Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Transactions of the IEICE E 72(3), 223-228 (1989)
13. Pin, J.-E.: On the Languages Accepted by Finite Reversible Automata. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 237-249. Springer, Heidelberg (1987)
14. Yokoyama, T., Axelsen, H.B., Glück, R.: Reversible Flowchart Languages and the Structured Reversible Program Theorem. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 258-270. Springer, Heidelberg (2008)