Ordered Restarting Automata for Picture Languages

DOI10.1007/978-3-319-04298-5_38zbMath1432.68237OpenAlexW131160620MaRDI QIDQ2938120

František Mráz, Friedrich Otto

Publication date: 13 January 2015

Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04298-5_38

zbMATH Keywords

picture languagerestarting automatonordered rewriting

Mathematics Subject Classification ID

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

Related Items (16)

Regulated variants of limited context restarting automata ⋮ Deterministic Ordered Restarting Automata that Compute Functions ⋮ Nondeterministic Ordered Restarting Automata ⋮ Unnamed Item ⋮ 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 ⋮ Automata with cyclic move operations for picture languages ⋮ Reversible Ordered Restarting Automata ⋮ On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata ⋮ On restarting automata with auxiliary symbols and small window size

This page was built for publication: Ordered Restarting Automata for Picture Languages