Descriptional Complexity of Iterated Uniform Finite-State Transducers

We introduce the deterministic computational model of an iterated uniform finite-state transducer (iufst). A iufst performs the same length-preserving transduction on several left-to-right sweeps. The first sweep takes place on the input string, while any other sweep processes the output of the previous one. The iufst accepts or rejects upon halting in an accepting or rejecting state along its sweeps. First, we focus on constant sweep bounded iufsts. We study their descriptional power vs. deterministic finite automata, and the state cost of implementing language operations. Then, we focus on non-constant sweep bounded iufsts, showing a nonregular language hierarchy depending on sweep complexity. The hardness of some classical decision problems on constant sweep bounded iufsts is also investigated.

[1]  Yuan Gao,et al.  A Survey on Operational State Complexity , 2015, J. Autom. Lang. Comb..

[2]  Derick Wood,et al.  On the state complexity of reversals of regular languages , 2004, Theor. Comput. Sci..

[3]  Juris Hartmanis,et al.  Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.

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

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

[6]  Martin Kutrib,et al.  Descriptional Complexity - An Introductory Survey , 2010, Scientific Applications of Language Methods.

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

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

[9]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[10]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, Symposium on the Theory of Computing.

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

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

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

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

[15]  Abraham Ginzburg,et al.  Chapter 5 – Coverings of Automata , 1968 .

[16]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

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