Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers

  title={Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers},
  author={Martin Kutrib and Andreas Malcher and Carlo Mereghetti and Beatrice Palano},
  journal={Fundam. Informaticae},
An iterated uniform finite-state transducer (IUFST) runs the same length-preserving transduction, starting with a sweep on the input string and then iteratively sweeping on the output of the previous sweep. The IUFST accepts the input string by halting in an accepting state at the end of a sweep. We consider both the deterministic (IUFST) and nondeterministic (NIUFST) version of this device. We show that constant sweep bounded IUFSTs and NIUFSTs accept all and only regular languages. We study… 



Descriptional Complexity of Iterated Uniform Finite-State Transducers

This work introduces the deterministic computational model of an iterated uniform finite-state transducer (iufst), and focuses on non-constant sweep bounded iufsts, showing a nonregular language hierarchy depending on sweep complexity.

Decision Problems on Iterated Length-Preserving Transducers

The main result of the paper is that both reset transducers and binary toggle transducers—which must express all letter transformations as permutations—are capable of simulating a Turing machine computation.

On Deterministic Multi-Pass Analysis

Deterministic chains of push-down transducers are introduced as a model of multi-pass compilers and the family is a strict hierarchy ordered by the length of the chain, which strictly includes the Boolean closure of deterministic languages.

Descriptional complexity of two-way pushdown automata with restricted head reversals

Testing the Descriptional Power of Small Turing Machines on Nonregular Language Acceptance

It is shown that, while for determinism and nondeterminism such lower bounds are optimal even with respect to unary languages, for alternation optimal lower bounds for unary language turn out to be strictly higher than those for languages over alphabets with two or more symbols.

Trace monoids with idempotent generators and measure-only quantum automata

It is proved that the LMO (Sigma, E) is a boolean algebra of recognizable languages with finite variation, and that it is properly contained in the recognizable languages, with the exception of the trivial case of complete commutativity.

Computational Complexity of One-Tape Turing Machine Computations

It is shown, among other things, that it is recursively undecidable how much time is required to recognize a nonregular context-free language on a one-tape Turing machine.