Advertisement

Minimal Reversible Deterministic Finite Automata

  • Markus Holzer
  • Sebastian Jakobi
  • Martin Kutrib
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9168)

Abstract

We study reversible deterministic finite automata (REV-DFAs), that are partial deterministic finite automata whose transition function induces an injective mapping on the state set for every letter of the input alphabet. We give a structural characterization of regular languages that can be accepted by REV-DFAs. This characterization is based on the absence of a forbidden pattern in the (minimal) deterministic state graph. Again with a forbidden pattern approach, we also show that the minimality of REV-DFAs among all equivalent REV-DFAs can be decided. Both forbidden pattern characterizations give rise to NL-complete decision algorithms. In fact, our techniques allow us to construct the minimal REV-DFA for a given minimal DFA. These considerations lead to asymptotic upper and lower bounds on the conversion from DFAs to REV-DFAs. Thus, almost all problems that concern uniqueness and the size of minimal REV-DFAs are solved.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angluin, D.: Inference of reversible languages. J. ACM 29, 741–765 (1982)MathSciNetCrossRefGoogle Scholar
  2. 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) CrossRefGoogle Scholar
  3. 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) CrossRefGoogle Scholar
  4. 4.
    Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)CrossRefGoogle Scholar
  5. 5.
    Cho, S., Huynh, D.T.: The parallel complexity of finite-state automata problems. Inform. Comput. 97, 1–22 (1992)MathSciNetCrossRefGoogle Scholar
  6. 6.
    García, P., Vázquez de Parga, M., López, D.: On the efficient construction of quasi-reversible automata for reversible languages. Inform. Process. Lett. 107, 13–17 (2008)Google Scholar
  7. 7.
    Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley (1978)Google Scholar
  8. 8.
    Héam, P.C.: A lower bound for reversible automata. RAIRO Inform. Théor. 34, 331–341 (2000)CrossRefGoogle Scholar
  9. 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) Google Scholar
  10. 10.
    Immerman, N.: Nondeterministic space is closed under complement. SIAM J. Comput. 17, 935–938 (1988)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Kobayashi, S., Yokomori, T.: Learning approximately regular languages with reversible languages. Theoret. Comput. Sci. 174, 251–257 (1997)MathSciNetCrossRefGoogle Scholar
  12. 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) Google Scholar
  13. 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)Google Scholar
  14. 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) CrossRefGoogle Scholar
  15. 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)Google Scholar
  16. 16.
    Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)MathSciNetCrossRefGoogle Scholar
  17. 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) CrossRefGoogle Scholar
  18. 18.
    Morita, K.: Two-way reversible multi-head finite automata. Fund. Inform. 110, 241–254 (2011)MathSciNetGoogle Scholar
  19. 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) CrossRefGoogle Scholar
  20. 20.
    Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE E72, 223–228 (1989)Google Scholar
  21. 21.
    Pin, J.E.: On reversible automata. In: Latin 1992: Theoretical Informatics. LNCS, vol. 583, pp. 401–416. Springer (1992)Google Scholar
  22. 22.
    Ruzzo, W.L., Simon, J., Tompa, M.: Space-bounded hierarchies and probabilistic computations. J. Comput. System Sci. 28, 216–230 (1984)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata. Acta Inform. 26, 279–284 (1988)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Wagner, K., Wechsung, G.: Computational Complexity. Reidel (1986)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Markus Holzer
    • 1
  • Sebastian Jakobi
    • 1
  • Martin Kutrib
    • 1
  1. 1.Institut für InformatikUniversität GiessenGiessenGermany

Personalised recommendations