Emmanuel Filiot
Skip Abstract Section
Abstract
The robust theory of regular languages is based on three important pillars: computation (automata), logic, and algebra. In this paper, we survey old and recent results on extensions of these pillars to functions from words to words. We consider two important classes of word functions, the rational and regular functions, respectively defined by one-way and two-way automata with output words, called transducers.
- Rajeev Alur and Pavol Černý. 2010. Expressiveness of streaming string transducers. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (LIPIcs), Vol. 8. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 1--12.Google Scholar
- Rajeev Alur and Pavol Černý. 2011. Streaming transducers for algorithmic verification of single-pass list-processing programs. In Proc. of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011. ACM, 599--610. Google ScholarDigital Library
- Rajeev Alur, Loris D'Antoni, and Mukund Raghothaman. 2015. DReX: A Declarative Language for Efficiently Evaluating Regular String Transformations. In Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, January 15-17, 2015. 125--137. Google ScholarDigital Library
- Rajeev Alur, Emmanuel Filiot, and Ashutosh Trivedi. 2012. Regular Transformations of Infinite Strings. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012. 65--74. Google ScholarDigital Library
- Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis. 2015. One-way definability of sweeping transducers. In 35th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015 (LIPIcs), Vol. 45. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 178--191.Google Scholar
- Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis. 2016. Minimizing resources of sweeping and streaming string transducers. In In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP'16) (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. To appear.Google Scholar
- Marie-Pierre Beál and Olivier Carton. 2002. Determinization of transducers over finite and infinite words. Theor. Comput. Sci. 289, 1 (2002), 225--251. Google ScholarDigital Library
- Marie-Pierre Beál, Olivier Carton, Christophe Prieur, and Jacques Sakarovitch. 2003. Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theoretical Computer Science 292, 1 (2003), 45--63. Google ScholarDigital Library
- Jean Berstel and Luc Boasson. 1979. Transductions and context-free languages. Ed. Teubner (1979), 1--278.Google Scholar
- Adrien Boiret, Aurélien Lemay, and Joachim Niehren. 2012. Learning Rational Functions. In Developments in Language Theory - 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings (Lecture Notes in Computer Science). Springer, 273--283. Google ScholarDigital Library
- Mikolaj Bojanczyk. 2014. Transducers with Origin Information. In 41st Internationl Colloquium on Automata, Languages, and Programming (ICALP) (LNCS), Vol. 8573. Springer, 26--37.Google Scholar
- J. R. Büchi. 1960. Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6, 1--6 (1960), 66--92.Google ScholarCross Ref
- Olivier Carton and Luc Dartois. 2015. Aperiodic Two-way Transducers and FO-Transductions. In Computer Science Logic (CSL) (LIPIcs), Vol. 41. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 160--174.Google Scholar
- Christian Choffrut. 1977. Une Caractérisation des Fonctions Séquentielles et des Fonctions Sous-Séquentielles en tant que Relations Rationnelles. Theor. Comput. Sci. 5, 3 (1977), 325--337.Google ScholarCross Ref
- Christian Choffrut. 1979. A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. In Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings. 88--103. Google ScholarDigital Library
- Christian Choffrut. 2003. Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292, 1 (2003), 131--143. Google ScholarDigital Library
- Bruno Courcelle. 1994. Monadic Second-Order Definable Graph Transductions: A Survey. Theor. Comput. Sci. 126 (1994), 53--75. Google ScholarDigital Library
- Bruno Courcelle and Joost Engelfriet. 2012. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach. Encyclopedia of mathematics and its applications, Vol. 138. Cambridge University Press. Google ScholarDigital Library
- K. Culik and J. Karhumaki. 1987. The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable. SIAM J. Comput. 16, 2 (1987), 221--230. Google ScholarDigital Library
- Karel Culik II and Juhani Karhumäki. 1986. The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable. Theor. Comput. Sci. 47, 3 (1986), 71--84. Google ScholarDigital Library
- Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, and Jean-Marc Talbot. 2016a. Two-Way Visibly Pushdown Automata and Transducers. In Proc. 31st Annual IEEE Symposium on Logic in Computer Science (LICS'16). IEEE Computer Society. To appear.Google ScholarDigital Library
- Luc Dartois, Ismaël Jecker, and Pierre-Alain Reynier. 2016b. Aperiodic String Transducers. In Proc. 20th International Conference on Developments in Language Theory (DLT 2016) (Lecture Notes in Computer Science). Springer. To appear.Google ScholarDigital Library
- Laure Daviaud, Pierre-Alain Reynier, and Jean-Marc Talbot. 2016. A Generalized Twinning Property for Minimisation of Cost Register Automata. In Proc. 31st Annual IEEE Symposium on Logic in Computer Science (LICS'16). IEEE Computer Society. To appear.Google Scholar
- Rodrigo de Souza. 2008. On the Decidability of the Equivalence for k-Valued Transducers. In Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings (Lecture Notes in Computer Science), Vol. 5257. Springer, 252--263. Google ScholarDigital Library
- Volker Diekert, Paul Gastin, and Manfred Kufleitner. 2008. A Survey on Small Fragments of First-Order Logic over Finite Words. Int. J. Found. Comput. Sci. 19, 3 (2008), 513--548.Google ScholarCross Ref
- C. C. Elgot. 1961. Decision Problems of Finite Automata Design and Related Arithmetics. In Transactions of the American Mathematical Society 98, 1 (1961), 21--51.Google ScholarCross Ref
- C. C. Elgot and J. E. Mezei. 1965. On relations defined by generalized finite automata. IBM Journal of Research and Development 9 (1965), 47--68. Google ScholarDigital Library
- Joost Engelfriet and Hendrik Jan Hoogeboom. 2001. MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2, 2 (2001), 216--254. Google ScholarDigital Library
- Joost Engelfriet and Sebastian Maneth. 2003. Macro Tree Translations of Linear Size Increase are MSO Definable. SIAM J. Comput. 32, 4 (2003), 950--1006.Google ScholarCross Ref
- Emmanuel Filiot. 2015. Logic-Automata Connections for Transformations. In Logic and Its Applications (ICLA). Springer, 30--57.Google Scholar
- Emmanuel Filiot, Olivier Gauwin, and Nathan Lhote. 2016. First-order definability of rational transductions: an algebraic approach. In Logic in Computer Science (LICS). IEEE.Google Scholar
- Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, and Frédéric Servais. 2013. From Two-Way to OneWay Finite State Transducers. In Logic in Computer Science (LICS). IEEE, 468--477. Google ScholarDigital Library
- Emmanuel Filiot, Ismaël Jecker, Christof Löding, and Sarah Winter. 2016. On Equivalence and Uniformisation Problems for Finite State Transducers. In ICALP. To appear.Google Scholar
- Emmanuel Filiot, Shankara Narayanan Krishna, and Ashutosh Trivedi. 2014. First-order Definable String Transformations. In Foundation of Software Technology and Theoretical Computer Science, (FSTTCS) (LIPIcs), Vol. 29. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 147--159.Google Scholar
- Emmanuel Filiot, Jean-Franois Raskin, Pierre-Alain Reynier, Frédéric Servais, and Jean-Marc Talbot. 2010. Properties of Visibly Pushdown Transducers. In Proc. 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10) (Lecture Notes in Computer Science), Vol. 6281. Springer, 355--367. DOI:http://dx.doi.org/10.1007/978-3-642-15155-2_32 Google ScholarDigital Library
- T. V. Griffiths. 1968. The Unsolvability of the Equivalence Problem for Lambda-Free Nondeterministic Generalized Machines. J. ACM 15, 3 (1968), 409--413. DOI:http://dx.doi.org/10.1145/321466.321473 Google ScholarDigital Library
- Eitan M. Gurari and Oscar H. Ibarra. 1983. A note on finite-valued and finitely ambiguous transducers. Mathematical systems theory 16, 1 (1983), 61--66.Google Scholar
- Nathan Lhote. 2015. Towards an algebraic characterization of rational word functions. CoRR abs/1506.06497 (2015). http://arxiv.org/abs/1506.06497Google Scholar
- Sebastian Maneth. 2015. A Survey on Decidable Equivalence Problems for Tree Transducers. Int. J. Found. Comput. Sci. 26, 8 (2015), 1069--1100. DOI:http://dx.doi.org/10.1142/S0129054115400134Google ScholarCross Ref
- Christophe Reutenauer and Marcel-Paul Schützenberger. 1991. Minimization of Rational Word Functions. SIAM J. Comput. 20, 4 (1991), 669--685. Google ScholarDigital Library
- Marcel Paul Schützenberger. 1975. Sur les relations rationnelles. In Proc. 2nd GI Conference on Automata Theory and Formal Languages, Kaiserslautern, May 20-23, 1975 (Lecture Notes in Computer Science), Vol. 33. Springer, 209--213. Google ScholarDigital Library
- Howard Straubing. 1994. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston, Basel and Berlin. Google ScholarDigital Library
- Boris Avraamovich Trakhtenbrot. 1961. Finite automata and logic of monadic predicates (in Russian). Dokl. Akad. Nauk SSSR 140 (1961), 326--329.Google Scholar
- Andreas Weber. 1993. Decomposing Finite-Valued Transducers and Deciding Their Equivalence. SIAM J. Comput. 22, 1 (1993), 175--202. Google ScholarDigital Library
- Andreas Weber and Reinhard Klemm. 1995. Economy of Description for Single-Valued Transducers. Information and Computation 118, 2 (1995), 327--340. Google ScholarDigital Library
Index Terms
- Transducers, logic and algebra for functions of finite words
Index terms have been assigned to the content through auto-classification.
Recommendations
MSO definable string transductions and two-way finite-state transducers
We extend a classic result of Büchi, Elgot, and Trakhtenbrot: MSO definable string transductions i.e., string-to-string functions that are definable by an interpretation using monadic second-order (MSO) logic, are exactly those realized by deterministic ...
From Two-Way to One-Way Finite State Transducers
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer ScienceAny two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherd son, states that two-way finite state automata (even non-deterministic) characterize ...
Determinization of transducers over finite and infinite words
We study the determinization of transducers over finite and infinite words. The first part of the paper is devoted to finite words. We recall the characterization of subsequential functions due to Choffrut. We describe here a known algorithm to ...
Comments