A Survey on Picture-Walking Automata
From MaRDI portal
Publication:3098039
DOI10.1007/978-3-642-24897-9_9zbMath1350.68174WikidataQ62045924 ScholiaQ62045924MaRDI QIDQ3098039
Publication date: 11 November 2011
Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_9
68Q45: Formal languages and automata
Related Items
Sets of Pictures Avoiding Overlaps, Plane-Walking Automata, Membership Problem for Two-Dimensional General Row Jumping Finite Automata, Non-expandable non-overlapping sets of pictures, Concatenation operations and restricted variants of two-dimensional automata, Problems on finite automata and the exponential time hypothesis, Simple picture processing based on finite automata and regular grammars, Decision problems and projection languages for restricted variants of two-dimensional automata, Two-dimensional codes, Degrees of restriction for two-dimensional automata, Characterization and measure of infinite two-dimensional strong prefix codes, Reversibility of computations in graph-walking automata, Unbordered Pictures: Properties and Construction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-dimensional alternative Turing machines
- Three-way automata on rectangular types over a one-letter alphabet
- A note on three-way two dimensional alternating Turing machines
- Halting space-bounded computations
- Three-way tape-bounded two-dimensional Turing machines
- A note on decision problems for three-way two-dimensional finite automata
- Some remarks on two-dimensional finite automata
- Complexity of two-dimensional patterns
- A note on two-dimensional probabilistic finite automata
- Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\(\circ\)-rotation
- A survey of two-dimensional automata theory
- Two-dimensional alternating turing machines with only universal states
- Alternating Pushdown and Stack Automata
- On Context-Free Languages
- Theory Is Forever