Iterated uniform finite-state transducers on unary languages

DOI10.1007/978-3-030-67731-2_16zbMATH Open1490.68128OpenAlexW3125702482MaRDI QIDQ831808FDOQ831808

Authors: Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano 

Publication date: 24 March 2022

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

Recommendations

• Descriptional complexity of iterated uniform finite-state transducers
• ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
• Iterated sequential transducers as language generating devices
• Finite automata and unary languages
• Iterating transducers

zbMATH Keywords

cellular automataunary languagesundecidability resultsstate complexityiterated transducers

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Descriptional complexity of iterated uniform finite-state transducers
• Iterated sequential transducers as language generating devices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Iterated uniform finite-state transducers on unary languages
• ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831808)