Deterministic ordered restarting automata for picture languages

DOI10.1007/s00236-015-0230-5zbMath1330.68174MaRDI QIDQ748435

František Mráz, Friedrich Otto

Publication date: 29 October 2015

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-015-0230-5

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton, Language acceptability of finite automata based on theory of semi‐tensor product of matrices, Automata with cyclic move operations for picture languages, Unnamed Item, On the descriptional complexity of stateless deterministic ordered restarting automata, Two-dimensional models, Two-dimensional codes, Characterization and measure of infinite two-dimensional strong prefix codes, Some classes of rational functions for pictures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computational model for tiling recognizable two-dimensional languages
• Some properties of two-dimensional on-line tessellation acceptors
• Complexity of two-dimensional patterns
• Restarting Tiling Automata
• Ordered Restarting Automata for Picture Languages
• Two-Dimensional Sgraffito Automata
• Restarting Automata for Picture Languages: A Survey on Recent Developments
• Picture Recognizability with Automata Based on Wang Tiles
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• Restarting automata
• Characterization of context-pree languages by erasing automata
• Two-dimensional Sgraffito automata
• New Results on Deterministic Sgraffito Automata
• Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata
• RESTARTING TILING AUTOMATA
• Extended Two-Way Ordered Restarting Automata for Picture Languages
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
• On the Descriptional Complexity of Deterministic Ordered Restarting Automata
• One-tape, off-line Turing machine computations