Skip to main content
SpringerLink
Log in

Reversible Ordered Restarting Automata

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

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

Included in the following conference series:

Abstract

Stateless deterministic ordered restarting automata characterize the class of regular languages. Here we introduce a notion of reversibility for these automata and show that each regular language is accepted by such a reversible stateless deterministic ordered restarting automaton. We study the descriptional complexity of these automata, showing that they are exponentially more succinct than nondeterministic finite-state acceptors. We also look at the case of unary input alphabets.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  Google Scholar 

  2. Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science 47, 149–158 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ellul, K.: Descriptional complexity measures of regular languages. Master’s thesis, University of Waterloo (2004)

    Google Scholar 

  4. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283–292. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  5. Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. System Sci. 78, 1814–1827 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kutrib, M., Malcher, A., Wendlandt, M.: Reversible queue automata. In: Bensch, S., Freund, R., Otto, F., (eds.) Proc. Sixth Workshop on Non-Classical Models of Automata and Applications \((\)NCMA 2014\()\), books@ocg.at, Band 304, pp. 163–178. Oesterreichische Computer Gesellschaft, Wien (2014)

    Google Scholar 

  7. Kwee, K., Otto, F.: On some decision problems for stateless deterministic ordered restarting automata. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 165–176. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  8. Landau, E.: Über die Maximalordnung der Permutationen gegebenen Grades. Archiv. der Math. und Phys. 3, 92–103 (1903)

    Google Scholar 

  9. Landau, E.: Handbuch von der Lehre der Verteilung der Primzahlen, vol. I. Teubner, Leipzig (1909)

    Google Scholar 

  10. Mráz, F., Otto, F.: Ordered restarting automata for picture languages. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 431–442. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  11. Otto, F.: Restarting automata. In: Ésik, Z., Martín-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Otto, F.: On the descriptional complexity of deterministic ordered restarting automata. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 318–329. Springer, Heidelberg (2014)

    Google Scholar 

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

    Google Scholar 

  14. 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)

    Chapter  Google Scholar 

  15. Szalay, M.: On the maximal order in \({S}_n\) and \({S}_n^*\). Acta Arithmetica 37, 321–331 (1980)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, Germany

    Friedrich Otto & Kent Kwee

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

    Matthias Wendlandt

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Wendlandt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kent Kwee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Friedrich Otto .

Editor information

Editors and Affiliations

  1. CNRS and Université Paris Diderot, Paris, France

    Jean Krivine

  2. Inria, St. Ismier Cedex, France

    Jean-Bernard Stefani

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Otto, F., Wendlandt, M., Kwee, K. (2015). Reversible Ordered Restarting Automata. In: Krivine, J., Stefani, JB. (eds) Reversible Computation. RC 2015. Lecture Notes in Computer Science(), vol 9138. Springer, Cham. https://doi.org/10.1007/978-3-319-20860-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20860-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20859-6

  • Online ISBN: 978-3-319-20860-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation