Reversible limited automata

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

Volumn 9288, Issue , 2015, Pages 113-128

  Kutrib, Martin ^a   Wendlandt, Matthias ^a  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

CHURCH-ROSSER LANGUAGES; COMPUTATIONAL POWER; CONTEXT-FREE; DETERMINISTIC-CONTEXT-FREE-LANGUAGES; REVERSIBLE COMPUTATIONS;

CONTEXT FREE LANGUAGES;

EID: 84945585986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-23111-2_8     Document Type: Conference Paper

References (29)

1. Angluin, D.: Inference of reversible languages. J. ACM 29, 741–765 (1982)
2. Axelsen, H.B.: 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)
3. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
4. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inform. Comput. 141, 1–36 (1998)
5. Hartmanis, J.: Computational complexity of one-tape Turing machine computations. J. ACM 15, 325–339 (1968)
6. Hennie, F.C.: One-tape, off-line Turing machine computations. Inform. Control 8, 553–578 (1965)
7. Hibbard, T.N.: A generalization of context-free determinism. Inform. Control 11, 196–238 (1967)
8. Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 276–287. Springer, Heidelberg (2015)
9. Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Foundations of Computer Science (FOCS 1997), pp. 66–75. IEEE Computer Society (1997)
10. Kutrib, M.: Aspects of reversibility for classical automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 83–98. Springer, Heidelberg (2014)
11. Kutrib, M., Malcher, A.: When Church-Rosser becomes context free. Int. J. Found. Comput. Sci. 18, 1293–1302 (2007)
12. Kutrib, M., Malcher, A.: Fast reversible language recognition using cellular automata. Inform. Comput. 206(9–10), 1142–1151 (2008)
13. Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78, 1814–1827 (2012)
14. Kutrib, M., Malcher, A.: One-way reversible multi-head finite automata. In: Glück, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 14–28. Springer, Heidelberg (2013)
15. Kutrib, M., Malcher, A., Wendlandt, M.: Reversible queue automata. In: Non- Classical Models of Automata and Applications (NCMA 2014), vol. 304, pp. 163– 178. Austrian Computer Society, Vienna (2014). books@ocg.at
16. Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. Int. J. Found. Comput. Sci. 21, 781–798 (2010)
17. Kutrib, M., Wendlandt, M.: On simulation costs of unary limited automata. In: Descriptional Complexity of Formal Systems (DCFS 2015). LNCS. Springer (2015, to appear)
18. Kutrib, M., Worsch, T.: Degrees of reversibility for DFA and DPDA. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 40–53. Springer, Heidelberg (2014)
19. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)
20. Lange, K.J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. System Sci. 60, 354–367 (2000)
21. McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. ACM 35, 324–344 (1988)
22. Morita, K.: Reversible computing and cellular automata - a survey. Theoret. Comput. Sci. 395, 101–131 (2008)
23. Morita, K.: Two-way reversible multi-head finite automata. Fund. Inform. 110, 241–254 (2011)
24. Morita, K.: A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads. In: Glück, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 29–43. Springer, Heidelberg (2013)
25. Niemann, G., Otto, F.: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inform. Comput. 197, 1–21 (2005)
26. Pighizzini, G., Pisoni, A.: Limited automata and regular languages. Int. J. Found. Comput. Sci. 25, 897–916 (2014)
27. Pighizzini, G., Pisoni, A.: Limited automata and context-free languages. Fund. Inform. 136, 157–176 (2015)
28. Pin, J.E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401–416. Springer, Heidelberg (1992)
29. Průša, D.: Weight-reducing Hennie machines and their descriptional complexity. In: Dediu, A.-H., Martín-Vide, C., Sierra-Rodr´ıguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 553–564. Springer, Heidelberg (2014)