Descriptional complexity of iterated uniform finite-state transducers

DOI10.1007/978-3-030-23247-4_17zbMath1434.68272OpenAlexW3204509642MaRDI QIDQ5918811

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Martin Kutrib

Publication date: 12 May 2020

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02387284

zbMATH Keywords

decidabilitystate complexityiterated transducerssweep complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Iterated uniform finite-state transducers on unary languages ⋮ Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* ⋮ Unnamed Item ⋮ Iterated uniform finite-state transducers on unary languages ⋮ Reversible pushdown transducers ⋮ The descriptional power of queue automata of constant length ⋮ Descriptional complexity of iterated uniform finite-state transducers ⋮ Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power

This page was built for publication: Descriptional complexity of iterated uniform finite-state transducers