Skip to main content
SpringerLink
Log in

Characterizing the Rational Functions by Restarting Transducers

  • Conference paper
Language and Automata Theory and Applications (LATA 2012)

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

Abstract

A restarting transducer is a restarting automaton that is equipped with an output function. Accordingly, restarting transducers compute binary relations, and deterministic restarting transducers compute functions. Here we characterize the rational functions and some of their proper subclasses by certain types of deterministic restarting transducers with window size one.

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. Aho, A., Sethi, R., Ullman, J.: Compilers: Principles and Techniques and Tools. Addison-Weslay, Reading (1986)

    MATH  Google Scholar 

  2. Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)

    Book  MATH  Google Scholar 

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

    Google Scholar 

  4. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  5. Hundeshagen, N., Otto, F.: Characterizing the Regular Languages by Nonforgetting Restarting Automata. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 288–299. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Hundeshagen, N., Otto, F., Vollweiler, M.: Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 163–172. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Monotonicity of restarting automata. J. Autom. Lang. Comb. 12, 355–371 (2007)

    MathSciNet  MATH  Google Scholar 

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

  9. Kutrib, M., Reimann, J.: Succinct description of regular languages by weak restarting automata. Inform. Comput. 206, 1152–1160 (2008)

    Google Scholar 

  10. Messerschmidt, H., Otto, F.: A hierarchy of monotone deterministic non-forgetting restarting automata. Theory Comput. Syst. 48, 343–373 (2011)

    Google Scholar 

  11. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23, 269–311 (1997)

    MathSciNet  Google Scholar 

  12. Mráz, F.: Lookahead hierarchies of restarting automata. J. Autom. Lang. Comb. 6, 493–506 (2001)

    MathSciNet  MATH  Google Scholar 

  13. Otto, F.: Restarting Automata. In: Ésik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. SCI, vol. 25, pp. 269–303. Springer, Berlin (2006)

    Chapter  Google Scholar 

  14. Santean, N.: Bimachines and structurally-reversed automata. J. Autom. Lang. Comb. 9, 121–146 (2004)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Norbert Hundeshagen & Friedrich Otto

Authors
  1. Norbert Hundeshagen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hundeshagen, N., Otto, F. (2012). Characterizing the Rational Functions by Restarting Transducers. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28332-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28331-4

  • Online ISBN: 978-3-642-28332-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation