Deterministic ordered restarting automata for picture languages
From MaRDI portal
Publication:748435
DOI10.1007/S00236-015-0230-5zbMath1330.68174OpenAlexW1996527228MaRDI 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
Related Items (9)
Unnamed Item ⋮ Characterization and measure of infinite two-dimensional strong prefix codes ⋮ Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton ⋮ Some classes of rational functions for pictures ⋮ On the descriptional complexity of stateless deterministic ordered restarting automata ⋮ Language acceptability of finite automata based on theory of semi‐tensor product of matrices ⋮ Automata with cyclic move operations for picture languages ⋮ Two-dimensional models ⋮ Two-dimensional codes
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
This page was built for publication: Deterministic ordered restarting automata for picture languages
