Advertisement

From Two-Way Transducers to Regular Function Expressions

  • Nicolas BaudruEmail author
  • Pierre-Alain Reynier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11088)

Abstract

Transducers constitute a fundamental extension of automata. The class of regular word functions has recently emerged as an important class of word-to-word functions, characterized by means of (functional, or unambiguous, or deterministic) two-way transducers, copyless streaming string transducers, and MSO-definable graph transformations. A fundamental result in language theory is Kleene’s Theorem, relating finite state automata and regular expressions. In [3], the authors introduced a set of regular function expressions and proved a similar result for regular word functions, by showing the equivalence with copyless streaming string transducers. In this paper, we propose a direct, simplified and effective translation from unambiguous two-way transducers to regular function expressions extending the Brzozowski and McCluskey algorithm. In addition, we identify a subset of regular function expressions characterizing the (strict) subclass of functional sweeping transducers.

References

  1. 1.
    Alur, R., Černý, P.: Expressiveness of streaming string transducers. In: FSTTCS. LIPIcs, vol. 8, pp. 1–12. Schloss Dagstuhl. Leibniz-Zent. Inform. (2010)Google Scholar
  2. 2.
    Alur, R., Filiot, E., Trivedi, A.: Regular transformations of infinite strings. In: LICS, pp. 65–74 (2012)Google Scholar
  3. 3.
    Alur, R., Freilich, A., Raghothaman, M.: Regular combinators for string transformations. In: CSL-LICS 2014, pp. 9:1–9:10. ACM (2014)Google Scholar
  4. 4.
    Baschenis, F., Gauwin, O., Muscholl, A., Puppis, G.: Untwisting two-way transducers in elementary time. In: LICS 2017, pp. 1–12. IEEE Computer Society (2017)Google Scholar
  5. 5.
    Berstel, J.: Transductions and context-free languages. Teubner Studienbücher: Informatik, vol. 38. Teubner, Stuttgart (1979)CrossRefGoogle Scholar
  6. 6.
    Bojańczyk, M.: Transducers with origin information. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 26–37. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-662-43951-7_3CrossRefGoogle Scholar
  7. 7.
    Brzozowski, J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. Electron. Comput. 12(2), 67–76 (1963)CrossRefGoogle Scholar
  8. 8.
    Carton, O., Dartois, L.: Aperiodic two-way transducers and FO-transductions. In: CSL. LIPIcs, vol. 41, pp. 160–174. Schloss Dagstuhl. Leibniz-Zent. Inform. (2015)Google Scholar
  9. 9.
    Choffrut, C., Guillon, B.: An algebraic characterization of unary two-way transducers. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 196–207. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-662-44522-8_17CrossRefzbMATHGoogle Scholar
  10. 10.
    Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci. 126(1), 53–75 (1994)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Dave, V., Gastin, P., Krishna, S.N.: Regular transducer expressions for regular transformations over infinite words. In: LICS 2018. IEEE Computer Society (2018, to appear)Google Scholar
  12. 12.
    Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2), 216–254 (2001)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Filiot, E., Gauwin, O., Reynier, P.A., Servais, F.: From two-way to one-way finite state transducers. In: LICS, pp. 468–477. IEEE Computer Society (2013)Google Scholar
  14. 14.
    Filiot, E., Krishna, S.N., Trivedi, A.: First-order definable string transformations. In: FSTTCS. LIPIcs, vol. 29, pp. 147–159. Schloss Dagstuhl. Leibniz-Zent. Inf. (2014)Google Scholar
  15. 15.
    Lombardy, S.: Two-way representations and weighted automata. RAIRO - Theoret. Inf. Appl. 50(4), 331–350 (2016)MathSciNetCrossRefGoogle Scholar
  16. 16.
    McNaughton, R., Papert, S.: Counter-Free Automata. The M.I.T. Press, Cambridge (1971)zbMATHGoogle Scholar
  17. 17.
    Schützenberger, M.P.: On the definition of a family of automata. Inf. Control 4(2–3), 245–270 (1961)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3(2), 198–200 (1959)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Aix Marseille Univ, Université de Toulon, CNRS, LISMarseilleFrance

Personalised recommendations