Deterministic ordered restarting automata for picture languages
From MaRDI portal
Publication:748435
DOI10.1007/S00236-015-0230-5zbMATH Open1330.68174OpenAlexW1996527228MaRDI QIDQ748435FDOQ748435
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
Recommendations
- Ordered restarting automata for picture languages
- Extended two-way ordered restarting automata for picture languages
- Nondeterministic ordered restarting automata
- Restarting automata for picture languages: a survey on recent developments
- On the effects of nondeterminism on ordered restarting automata
Cites Work
- Restarting automata
- Complexity of two-dimensional patterns
- RESTARTING TILING AUTOMATA
- A computational model for tiling recognizable two-dimensional languages
- One-tape, off-line Turing machine computations
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Some properties of two-dimensional on-line tessellation acceptors
- Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata
- Title not available (Why is that?)
- Church-Rosser picture languages and their applications in picture recognition
- 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
- 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
- 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
- Title not available (Why is that?)
Cited In (9)
- Language acceptability of finite automata based on theory of semi‐tensor product of matrices
- Two-dimensional codes
- Title not available (Why is that?)
- Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton
- Some classes of rational functions for pictures
- Two-dimensional models
- On the descriptional complexity of stateless deterministic ordered restarting automata
- Automata with cyclic move operations for picture languages
- Characterization and measure of infinite two-dimensional strong prefix codes
This page was built for publication: Deterministic ordered restarting automata for picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q748435)
