Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-02387284
Contributor : Hal Ifip <>
Submitted on : Friday, November 29, 2019 - 4:35:26 PM
Last modification on : Friday, November 29, 2019 - 5:01:54 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

69