Deterministic Ordered Restarting Automata that Compute Functions
From MaRDI portal
Publication:3451119
DOI10.1007/978-3-319-21500-6_32zbMath1434.68283OpenAlexW2295522888MaRDI QIDQ3451119
Publication date: 10 November 2015
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21500-6_32
Related Items
Some classes of rational functions for pictures ⋮ On the descriptional complexity of stateless deterministic ordered restarting automata
Cites Work
- Unnamed Item
- Reversible Ordered Restarting Automata
- Characterizing the Rational Functions by Restarting Transducers
- Ordered Restarting Automata for Picture Languages
- Properties of Finite and Pushdown Transducers
- Weight-Reducing Hennie Machines and Their Descriptional Complexity
- On the Descriptional Complexity of Deterministic Ordered Restarting Automata
- On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
- On Relations Defined by Generalized Finite Automata