Skip to main content
SpringerLink
Log in

Deterministic Ordered Restarting Automata that Compute Functions

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9168))

Included in the following conference series:

Abstract

We present three methods for using deterministic ordered restarting automata to compute relations and functions. In the most general setting we obtain succinct representations for all rational relations, and in the most restricted setting we derive a succinct description for all rational functions that map the empty word to itself. In addition, we study the deterministic ordered restarting transducer that characterizes a proper superclass of the rational functions.

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. Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)

    Book  Google Scholar 

  2. Choffrut, C., Culik II, K.: Properties of finite and pushdown transducers. SIAM J. Comput. 12, 300–315 (1983)

    Article  MathSciNet  Google Scholar 

  3. Elgot, C.C., Mezei, G.: On relations defined by generalized finite automata. IBM Journal of Research and Development 9, 47–65 (1965)

    Article  MathSciNet  Google Scholar 

  4. Hundeshagen, N.: Relations and Transductions Realized by RestartingAutomata. PhD thesis, Fachbereich Elektrotechnik/Informatik, Universität Kassel (2013)

    Google Scholar 

  5. Hundeshagen, N., Otto, F.: Characterizing the rational functions by restarting transducers. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 325–336. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

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

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

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

  9. Otto, F., Wendlandt, M., Kwee, K.: Reversible ordered restarting automata. In: Krevine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 60–75. Springer, Heidelberg (2015)

    Google Scholar 

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

Download references

Author information

Authors and Affiliations

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

    Friedrich Otto & Kent Kwee

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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. University of Liverpool, Liverpool, United Kingdom

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Otto, F., Kwee, K. (2015). Deterministic Ordered Restarting Automata that Compute Functions. In: Potapov, I. (eds) Developments in Language Theory. DLT 2015. Lecture Notes in Computer Science(), vol 9168. Springer, Cham. https://doi.org/10.1007/978-3-319-21500-6_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21500-6_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21499-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation