Minimal reversible deterministic finite automata

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

Volumn 9168, Issue , 2015, Pages 276-287

  Holzer, Markus ^a   Jakobi, Sebastian ^a   Kutrib, Martin ^a  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; COMPUTATIONAL LINGUISTICS;

DECISION ALGORITHMS; DETERMINISTIC FINITE AUTOMATA; FORBIDDEN PATTERN; INJECTIVE MAPPING; STATE GRAPHS; STRUCTURAL CHARACTERIZATION; TRANSITION FUNCTIONS; UPPER AND LOWER BOUNDS;

FINITE AUTOMATA;

EID: 84947054802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-21500-6_22     Document Type: Conference Paper

References (24)

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. 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)
4. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
5. Cho, S., Huynh, D.T.: The parallel complexity of finite-state automata problems. Inform. Comput. 97, 1–22 (1992)
6. García, P., Vazquez de Parga, M., Lopez, D.: On the efficient construction of quasi-reversible automata for reversible languages. Inform. Process. Lett. 107, 13–17 (2008)
7. Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley (1978)
8. Heam, P.C.: A lower bound for reversible automata. RAIRO Inform. Theor. 34, 331–341 (2000)
9. Holzer, M., Jakobi, S.: Minimal and Hyper-Minimal Biautomata. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 291–302. Springer, Heidelberg (2014)
10. Immerman, N.: Nondeterministic space is closed under complement. SIAM J. Comput. 17, 935–938 (1988)
11. Kobayashi, S., Yokomori, T.: Learning approximately regular languages with reversible languages. Theoret. Comput. Sci. 174, 251–257 (1997)
12. Kutrib, M.: Aspects of Reversibility for Classical Automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Gruska Festschrift. LNCS, vol. 8808, pp. 83–98. Springer, Heidelberg (2014)
13. 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)
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). books@ocg.at, vol. 304, pp. 163–178. Austrian Computer Society, Vienna (2014)
16. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)
17. Lombardy, S.: On the Construction of Reversible Automata for Reversible Languages. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 170–182. Springer, Heidelberg (2002)
18. Morita, K.: Two-way reversible multi-head finite automata. Fund. Inform. 110, 241–254 (2011)
19. 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)
20. Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE E72, 223–228 (1989)
21. Pin, J.E.: On reversible automata. In: Latin 1992: Theoretical Informatics. LNCS, vol. 583, pp. 401–416. Springer (1992)
22. Ruzzo, W.L., Simon, J., Tompa, M.: Space-bounded hierarchies and probabilistic computations. J. Comput. System Sci. 28, 216–230 (1984)
23. Szelepcsenyi, R.: The method of forced enumeration for nondeterministic automata. Acta Inform. 26, 279–284 (1988)
24. Wagner, K., Wechsung, G.: Computational Complexity. Reidel (1986)