Iterated uniform finite-state transducers on unary languages

DOI10.1007/978-3-030-67731-2_16zbMath1490.68128OpenAlexW3125702482MaRDI QIDQ831808

Martin Kutrib, Beatrice Palano, Carlo Mereghetti, Andreas Malcher

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_16

zbMATH Keywords

cellular automatastate complexityunary languagesundecidability resultsiterated transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (2)

Unnamed Item ⋮ Iterated uniform finite-state transducers on unary languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cellular automata with limited inter-cell bandwidth
• Complexity of multi-head finite automata: origins and directions
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Iterated sequential transducers as language generating devices
• Finite automata and unary languages
• Signals in one-dimensional cellular automata
• Finite-state transducer cascades to extract named entities in texts.
• Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
• Optimal Simulations between Unary Automata
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE
• On Deterministic Multi-Pass Analysis
• ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• Descriptional complexity of iterated uniform finite-state transducers

This page was built for publication: Iterated uniform finite-state transducers on unary languages