Iterated uniform finite-state transducers on unary languages
From MaRDI portal
Publication:6165558
DOI10.1016/j.tcs.2023.114049OpenAlexW4382051328MaRDI QIDQ6165558
Carlo Mereghetti, Beatrice Palano, Martin Kutrib, Andreas Malcher
Publication date: 1 August 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114049
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 uniform finite-state transducers on unary languages
- 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.
- Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion
- 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
- Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
- Computational Complexity of One-Tape Turing Machine Computations
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- Descriptional complexity of iterated uniform finite-state transducers
- Descriptional complexity of iterated uniform finite-state transducers
This page was built for publication: Iterated uniform finite-state transducers on unary languages
