Deterministic ordered restarting automata for picture languages
From MaRDI portal
Publication:748435
DOI10.1007/S00236-015-0230-5zbMATH Open1330.68174OpenAlexW1996527228MaRDI QIDQ748435FDOQ748435
Authors: Friedrich Otto, František Mráz 
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-free 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 (15)
- Two-dimensional codes
- Title not available (Why is that?)
- Language acceptability of finite automata based on theory of semi-tensor product of matrices
- Simulating parallel internal column contextual array grammars using two-dimensional parallel restarting automata with multiple windows
- Some classes of rational functions for pictures
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
- Extended two-way ordered restarting automata for picture languages
- Restarting automata for picture languages: a survey on recent developments
- Ordered restarting automata for picture languages
- Two-dimensional models
- On deterministic ordered restart-delete automata
- On the descriptional complexity of stateless deterministic ordered restarting automata
- On the effects of nondeterminism on 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)
