Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2018: Developments in Language Theory pp 96–108Cite as

From Two-Way Transducers to Regular Function Expressions

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

P.-A. Reynier is funded by the DeLTA project (ANR-16-CE40-0007).

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    Given two FEFs \(E,E'\) with same underlying flow F, \(E\oplus E'\) is the FEF with flow F and set of edges \(\{(x,f\oplus f',y) \mid (x,f,y)\in E, (x,f',y)\in E' \}\).

References

  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. Alur, R., Filiot, E., Trivedi, A.: Regular transformations of infinite strings. In: LICS, pp. 65–74 (2012)

    Google Scholar 

  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. 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. Berstel, J.: Transductions and context-free languages. Teubner Studienbücher: Informatik, vol. 38. Teubner, Stuttgart (1979)

    Book  Google Scholar 

  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_3

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

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

    Chapter  MATH  Google Scholar 

  10. Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci. 126(1), 53–75 (1994)

    Article  MathSciNet  Google Scholar 

  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. Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2), 216–254 (2001)

    Article  MathSciNet  Google Scholar 

  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. 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. Lombardy, S.: Two-way representations and weighted automata. RAIRO - Theoret. Inf. Appl. 50(4), 331–350 (2016)

    Article  MathSciNet  Google Scholar 

  16. McNaughton, R., Papert, S.: Counter-Free Automata. The M.I.T. Press, Cambridge (1971)

    MATH  Google Scholar 

  17. Schützenberger, M.P.: On the definition of a family of automata. Inf. Control 4(2–3), 245–270 (1961)

    Article  MathSciNet  Google Scholar 

  18. Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3(2), 198–200 (1959)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France

    Nicolas Baudru & Pierre-Alain Reynier

Authors
  1. Nicolas Baudru
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre-Alain Reynier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolas Baudru .

Editor information

Editors and Affiliations

  1. National Archives of Japan, Tokyo, Japan

    Mizuho Hoshi

  2. The University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Baudru, N., Reynier, PA. (2018). From Two-Way Transducers to Regular Function Expressions. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98654-8_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98653-1

  • Online ISBN: 978-3-319-98654-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation