Deterministic ordered restarting automata for picture languages
From MaRDI portal
(Redirected from Publication:748435)
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
- scientific article; zbMATH DE number 1689049 (Why is no real title available?)
- scientific article; zbMATH DE number 3412183 (Why is no real title available?)
- A computational model for tiling recognizable two-dimensional languages
- Characterization of context-free languages by erasing automata
- Church-Rosser picture languages and their applications in picture recognition
- Comparing two-dimensional one-marker automata to sgraffito automata
- Complexity of two-dimensional patterns
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata
- Extended two-way ordered restarting automata for picture languages
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- New results on deterministic sgraffito automata
- On the descriptional complexity of deterministic ordered restarting automata
- One-tape, off-line Turing machine computations
- Ordered restarting automata for picture languages
- Picture recognizability with automata based on Wang tiles
- Restarting automata
- Restarting automata for picture languages: a survey on recent developments
- Restarting tiling automata
- Restarting tiling automata
- Some properties of two-dimensional on-line tessellation acceptors
- Two-dimensional Sgraffito automata
- Two-dimensional sgraffito automata
Cited in
(15)- On the effects of nondeterminism on ordered restarting automata
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
- Some classes of rational functions for pictures
- On deterministic ordered restart-delete automata
- Simulating parallel internal column contextual array grammars using two-dimensional parallel restarting automata with multiple windows
- Language acceptability of finite automata based on theory of semi-tensor product of matrices
- 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
- Automata with cyclic move operations for picture languages
- Two-dimensional models
- scientific article; zbMATH DE number 7584603 (Why is no real title available?)
- Two-dimensional codes
- Characterization and measure of infinite two-dimensional strong prefix codes
- On the descriptional complexity of stateless deterministic ordered restarting automata
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)
