On the Effects of Nondeterminism on Ordered Restarting Automata

DOI10.1007/978-3-662-49192-8_30zbMath1442.68095OpenAlexW2406421587MaRDI QIDQ2794377

Friedrich Otto, Kent Kwee

Publication date: 10 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49192-8_30

zbMATH Keywords

descriptional complexityabstract family of languagesrestarting automatonordered rewriting

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (9)

Regulated variants of limited context restarting automata ⋮ 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 ⋮ On Ordered RRWW-Automata ⋮ On restarting automata with auxiliary symbols and small window size

This page was built for publication: On the Effects of Nondeterminism on Ordered Restarting Automata