Skip to main content
SpringerLink
Log in

Reversible Nondeterministic Finite Automata

  • Conference paper
  • First Online:
Reversible Computation (RC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10301))

Included in the following conference series:

Abstract

By former and recent results the model of reversible deterministic finite automata is well understood. On the other hand, reversible nondeterministic finite automata and their accepted languages have not systematically been considered in the literature. Here it turns out that reversible nondeterministic finite automata (\(\text {REV-NFA}\)s) are more powerful compared to their reversible deterministic counterparts, but still cannot accept all regular languages. Moreover, we compare the family of languages accepted by \(\text {REV-NFA}\)s to the language families accepted by deterministic and nondeterministic finite state automata with irreversibility degree k. Besides these results on the computational power of \(\text {REV-NFA}\)s we consider closure properties of the language family induced by these devices.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weakness and generalizations. In: Motwani, R. (ed.) Foundations of Computer Science (FOCS 1998), pp. 332–341. IEEE Computer Society (1998)

    Google Scholar 

  2. Angluin, D.: Inference of reversible languages. J. ACM 29, 741–765 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Axelsen, H.B., Holzer, M., Kutrib, M.: The degree of irreversibility in deterministic finite automata. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 15–26. Springer, Cham (2016). doi:10.1007/978-3-319-40946-7_2

    Chapter  Google Scholar 

  4. 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). doi:10.1007/978-3-642-21254-3_8

    Chapter  Google Scholar 

  5. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  6. García, P., de Parga, M.V., López, D.: On the efficient construction of quasi-reversible automata for reversible languages. Inform. Process. Lett. 107, 13–17 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gill, A., Kou, L.T.: Multiple-entry finite automata. J. Comput. System Sci. 9, 1–19 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  8. Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)

    MATH  Google Scholar 

  9. Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 276–287. Springer, Cham (2015). doi:10.1007/978-3-319-21500-6_22

    Chapter  Google Scholar 

  10. Holzer, M., Salomaa, K., Yu, S.: On the state complexity of \(k\)-entry deterministic finite automata. J. Autom. Lang. Comb. 6, 453–466 (2001)

    MathSciNet  MATH  Google Scholar 

  11. Kappes, M.: Descriptional complexity of deterministic finite automata with multiple initial states. J. Autom. Lang. Comb. 5, 265–278 (2000)

    MathSciNet  MATH  Google Scholar 

  12. Kobayashi, S., Yokomori, T.: Learning approximately regular languages with reversible languages. Theoret. Comput. Sci. 174, 251–257 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lavado, G.J., Pighizzini, G., Prigioniero, L.: Minimal and reduced reversible automata. In: Câmpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 168–179. Springer, Cham (2016). doi:10.1007/978-3-319-41114-9_13

    Chapter  Google Scholar 

  14. Lombardy, S.: On the construction of reversible automata for reversible languages. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 170–182. Springer, Heidelberg (2002). doi:10.1007/3-540-45465-9_16

    Chapter  Google Scholar 

  15. Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE E72, 223–228 (1989)

    Google Scholar 

  16. Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401–416. Springer, Heidelberg (1992). doi:10.1007/BFb0023844

    Google Scholar 

  17. Veloso, P.A.S., Gill, A.: Some remarks on multiple-entry finite automata. J. Comput. System Sci. 18, 304–306 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Markus Holzer & Martin Kutrib

Authors
  1. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Markus Holzer .

Editor information

Editors and Affiliations

  1. Imperial College London, London, United Kingdom

    Iain Phillips

  2. Indian Institute of Engineering Science and Technology, Shibpur, India

    Hafizur Rahaman

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Holzer, M., Kutrib, M. (2017). Reversible Nondeterministic Finite Automata. In: Phillips, I., Rahaman, H. (eds) Reversible Computation. RC 2017. Lecture Notes in Computer Science(), vol 10301. Springer, Cham. https://doi.org/10.1007/978-3-319-59936-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59936-6_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59935-9

  • Online ISBN: 978-3-319-59936-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation