[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Restarting Transducers, Regular Languages, and Rational Relations

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

A (nonforgetting) restarting transducer is a (nonforgetting) 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. As a preliminary step we prove that the monotone variants of the nonforgetting R- and the nonforgetting deterministic RR-automata with window size one only accept regular languages.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Aho, A., Hopcroft, J., Ullman, J.: A general theory of translation. Math. Systems Theory 3, 193–221 (1969)

    Article  MATH  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

  3. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inform. and Comput. 141, 1–36 (1998)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Greibach, S.: A note on pushdown store automata and regular systems. Proceedings of the AMS 18, 263–268 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hopcroft, J., Ullman, J.: Introduction to automata theory, languages, and computation Addison-Wesley, Reading (1979)

    Google Scholar 

  7. Hundeshagen, N., Otto, F.: Characterizing the regular languages by nonforgetting restarting automata. In: Mauri, G., Leporati, A. (eds.) Proceedings of DLT 2011, LNCS 6795, pp. 288–299. Springer, Berlin (2011)

  8. Hundeshagen, N., Otto, F.: Characterizing the rational functions by restarting transducers. In: Dediu, A.H., Martin-Vide, C. (eds.) Proceedings of LATA 2012, LNCS 7183, pp. 325–336. Springer, Berlin (2012)

  9. Hundeshagen, N., Otto, F., Vollweiler, M.: Transductions computed by PC-systems of monotone deterministic restarting automata. In: Domaratzki,M., Salomaa, K. (eds.) Proceedings of CIAA 2010, LNCS 6482, pp. 163–172. Springer, Berlin (2011)

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

    MATH  MathSciNet  Google Scholar 

  11. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) Proceedings of FCT’95, LNCS 965, pp. 283–292. Springer, Berlin (1995)

    Google Scholar 

  12. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On restarting automata with rewriting. In: Păun, G., Salomaa, A. (eds.) New trends in formal languages, LNCS 1218, pp. 119–136. Springer, Berlin (1997)

    Google Scholar 

  13. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On monotonic automata with a restart operation. J. Autom. Lang. Comb. 4, 287–311 (1999)

    MATH  MathSciNet  Google Scholar 

  14. Jurasky, D., Martin, J.: Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics and Speech Recognition Prentice Hall series in Artificial Intelligence. 2nd edn. Prentice Hall, Englewood Cliffs (2009)

    Google Scholar 

  15. Kaplan, R., Kay, M.: Regular models of phonological rule systems. Comput. Linguis. 20, 331–378 (1994)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. Assoc. Comput. Mach. 35, 324–344 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  18. Messerschmidt, H., Otto, F.: Cooperating distributed systems of restarting automata. Intern. J. Found. Comp. Sci. 18, 1333–1342 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  19. Messerschmidt, H., Otto, F.: On deterministic CD-systems of restarting automata. Intern. J. Found. Comp. Sci. 20, 185–209 (2009)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Messerschmidt, H., Stamer, H.: Restart-Automaten mit mehreren Restart-Zuständen. In: Bordihn, H. (ed.) Proceedings of Workshop ‘Formale Sprachen in der Linguistik’ und 14. Theorietag ‘Automaten und Formale Sprachen’, pp. 111–116. Institut für Informatik, Universität Potsdam (2004)

  22. Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguis. 23, 269–311 (1997)

    MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  25. Reimann, J.: Beschreibungskomplexität von Restart-Automaten. Ph.D. thesis, Naturwissenschaftliche Fachbereiche, Justus-Liebig-Universität Giessen (2007)

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

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, D-34109, Kassel, Hessen, 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

Corresponding author

Correspondence to Friedrich Otto.

Additional information

The results of this paper have been announced at DLT 2011 and at LATA 2012. Extended abstracts appeared in the proceedings of these conferences [7, 8].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hundeshagen, N., Otto, F. Restarting Transducers, Regular Languages, and Rational Relations. Theory Comput Syst 57, 195–225 (2015). https://doi.org/10.1007/s00224-014-9579-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-014-9579-z

Keywords

Search

Navigation