On the Descriptional Complexity of Deterministic Ordered Restarting Automata

DOI10.1007/978-3-319-09704-6_28zbMath1416.68108OpenAlexW315032223MaRDI QIDQ5496199

Friedrich Otto

Publication date: 7 August 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-09704-6_28

zbMATH Keywords

descriptional complexityrestarting automatonlanguage operationsordered rewriting

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (13)

Regulated variants of limited context restarting automata ⋮ Deterministic Ordered Restarting Automata that Compute Functions ⋮ Nondeterministic Ordered Restarting Automata ⋮ Some classes of rational functions for pictures ⋮ On the descriptional complexity of stateless deterministic ordered restarting automata ⋮ A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata ⋮ On the expressive power of stateless ordered restart-delete automata ⋮ On deterministic ordered restart-delete automata ⋮ Reversibility for stateless ordered RRWW-automata ⋮ Deterministic ordered restarting automata for picture languages ⋮ On Ordered RRWW-Automata ⋮ Reversible Ordered Restarting Automata ⋮ On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata

This page was built for publication: On the Descriptional Complexity of Deterministic Ordered Restarting Automata