Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

[1]  Andreas Malcher,et al.  Descriptional complexity of two-way pushdown automata with restricted head reversals , 2011, Theor. Comput. Sci..

[2]  Carlo Mereghetti,et al.  The size-cost of Boolean operations on constant height deterministic pushdown automata , 2012, Theor. Comput. Sci..

[3]  Denis Maurel,et al.  Finite-state transducer cascades to extract named entities in texts , 2004, Theor. Comput. Sci..

[4]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[5]  Carlo Mereghetti,et al.  Complexity of Promise Problems on Classical and Quantum Automata , 2014, Computing with New Resources.

[6]  Carlo Mereghetti.  Testing the Descriptional Power of Small Turing Machines on Nonregular Language Acceptance , 2008, Int. J. Found. Comput. Sci..

[7]  Martin Kutrib,et al.  Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power , 2020, CiE.

[8]  Claudio Citrini,et al.  On Deterministic Multi-Pass Analysis , 1986, SIAM J. Comput..

[9]  Carlo Mereghetti,et al.  Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata , 2001, RAIRO Theor. Informatics Appl..

[10]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[11]  Abraham Ginzburg,et al.  Algebraic theory of automata , 1968 .

[12]  Beatrice Palano,et al.  Behaviours of Unary Quantum Automata , 2010, Fundam. Informaticae.

[13]  Carlo Mereghetti,et al.  Removing nondeterminism in constant height pushdown automata , 2014, Inf. Comput..

[14]  Alberto Bertoni,et al.  Trace monoids with idempotent generators and measure-only quantum automata , 2010, Natural Computing.

[15]  Martin Kutrib,et al.  Deterministic input-driven queue automata: Finite turns, decidability, and closure properties , 2015, Theor. Comput. Sci..

[16]  Carlo Mereghetti,et al.  Two-Way Automata Simulations and Unary Languages , 2000, J. Autom. Lang. Comb..

[17]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[18]  Michael O. Rabin,et al.  Probabilistic Automata , 1963, Inf. Control..

[19]  Henning Fernau,et al.  Iterated sequential transducers as language generating devices , 2006, Theor. Comput. Sci..

[20]  Martin Kutrib,et al.  Descriptional Complexity of Iterated Uniform Finite-State Transducers , 2019, DCFS.

[21]  Vincenzo Manca,et al.  On the Generative Power of Iterated Transductions , 2001, Words, Semigroups, and Transductions.