Descriptional Complexity of Iterated Uniform Finite-State Transducers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Descriptional Complexity of Iterated Uniform Finite-State Transducers

Abstract

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.
Fichier principal
Vignette du fichier
480958_1_En_17_Chapter.pdf (336.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02387284 , version 1 (29-11-2019)

Licence

Attribution

Identifiers

Cite

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano. Descriptional Complexity of Iterated Uniform Finite-State Transducers. 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.223-234, ⟨10.1007/978-3-030-23247-4_17⟩. ⟨hal-02387284⟩
34 View
29 Download

Altmetric

Share

Gmail Facebook X LinkedIn More