Continuity and Rational Functions

A word-to-word function is continuous for a class of languages $\mathcal{V}$ if its inverse maps $\mathcal{V}$-languages to $\mathcal{V}$. This notion provides a basis for an algebraic study of transducers, and was integral to the characterization of the sequential transducers computable in some circuit complexity classes. Here, we report on the decidability of continuity for functional transducers and some standard classes of regular languages. Previous algebraic studies of transducers have focused on the structure of the underlying input automaton, disregarding the output. We propose a comparison of the two algebraic approaches through two questions: When are the automaton structure and the continuity properties related, and when does continuity propagate to superclasses?

[1]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[2]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[3]  Nathan Lhote,et al.  First-order definability of rational transductions: An algebraic approach , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[4]  Jean-Eric Pin,et al.  Profinite Semigroups, Mal'cev Products, and Identities☆ , 1996 .

[5]  Pedro V. Silva,et al.  On uniformly continuous functions for some profinite topologies , 2017, Theor. Comput. Sci..

[6]  Michaël Cadilhac,et al.  A Circuit Complexity Approach to Transductions , 2015, MFCS.

[7]  Serge Grigorieff,et al.  Duality and Equational Theory of Regular Languages , 2008, ICALP.

[8]  Jorge Almeida,et al.  Some Algorithmic Problems for Pseudovarieties , 1999 .

[9]  Jacques Sakarovitch,et al.  Une Application de la Representation Matricielle des Transductions , 1985, Theor. Comput. Sci..

[10]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[11]  Jacques Sakarovitch,et al.  Some operations and transductions that preserve rationality , 1983, Theoretical Computer Science.

[12]  Pedro V. Silva,et al.  A topological approach to transductions , 2005, Theor. Comput. Sci..

[13]  D. Robinson.  A Course in the Theory of Groups , 1982 .

[14]  Pedro V. Silva,et al.  On Profinite Uniform Structures Defined by Varieties of Finite Monoids , 2011, Int. J. Algebra Comput..

[15]  Christophe Reutenauer,et al.  Variétés et fonctions rationnelles , 1995, Theor. Comput. Sci..

[16]  Equidivisible pseudovarieties of semigroups , 2016, 1603.00330.