A survey of two-dimensional automata theory
From MaRDI portal
Publication:2638801
Recommendations
- Some remarks on two-dimensional finite automata
- Some results concerning two-dimensional turing machines and finite automata
- Developments in Language Theory
- Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
- Degrees of restriction for two-dimensional automata
- Two-dimensional sgraffito automata
- Two-dimensional Sgraffito automata
- A note on two-dimensional probabilistic finite automata
- Towards more expressive 2D deterministic automata
- Equivalence of two-dimensional multitape automata
Cites work
- scientific article; zbMATH DE number 3848615 (Why is no real title available?)
- scientific article; zbMATH DE number 3848616 (Why is no real title available?)
- scientific article; zbMATH DE number 3872685 (Why is no real title available?)
- scientific article; zbMATH DE number 3821108 (Why is no real title available?)
- scientific article; zbMATH DE number 3976349 (Why is no real title available?)
- scientific article; zbMATH DE number 4037204 (Why is no real title available?)
- scientific article; zbMATH DE number 4049051 (Why is no real title available?)
- scientific article; zbMATH DE number 4049110 (Why is no real title available?)
- scientific article; zbMATH DE number 4080916 (Why is no real title available?)
- scientific article; zbMATH DE number 3673535 (Why is no real title available?)
- scientific article; zbMATH DE number 3718546 (Why is no real title available?)
- scientific article; zbMATH DE number 3722098 (Why is no real title available?)
- scientific article; zbMATH DE number 3738961 (Why is no real title available?)
- scientific article; zbMATH DE number 3596254 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3363526 (Why is no real title available?)
- scientific article; zbMATH DE number 3386919 (Why is no real title available?)
- A finite 5-pebble-automaton can search every maze
- A hierarchy of random-context grammars and automata
- A note on bottom-up pyramid acceptors
- A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines
- A note on decision problems for three-way two-dimensional finite automata
- A note on deterministic three-way tape-bounded two-dimensional Turing machines
- A note on three-way two dimensional alternating Turing machines
- A note on time-bounded bottom-up pyramid cellular acceptors
- A note on two-dimensional finite automata
- A region crossing problem for array-bounded automata
- Acceptors for isometric parallel context-free array languages
- Alternation
- Array automata and operations on array languages
- Automata and Labyrinths
- Closure properties of three-way and four-way tape-bounded two-dimensional Turing machines
- Connected pictures are not recognizable by deterministic two-dimensional on-line tessellation acceptors
- Cyclic closure properties of automata on a two-dimensional tape
- Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\(\circ\)-rotation
- Extended controlled table L-arrays
- Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages
- Halting space-bounded computations
- Lower bounds for language recognition on two-dimensional alternating multihead machines
- Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure
- Nondeterministic Space is Closed under Complementation
- On Some Open Problems in the Theory of Cellular Automata
- On real-time cellular automata and trellis automata
- One-Pass Complexity of Digital Picture Properties
- One-way bounded cellular automata
- Parallel Image Processing by Memory-Augmented Cellular Automata
- Parallel/sequential array automata
- Pushdown automata on arrays
- Real-time language recognition by one-dimensional cellular automata
- Real-time recognition of two-dimensional tapes by cellular automata
- Recognition of topological equivalence of patterns by array automata
- Relation of one-way parallel/sequential automata to 2-D finite-state automata
- Relationships between nondeterministic and deterministic tape complexities
- Simulation of three-dimensional one-marker automata by five-way Turing machines
- Some notes on finite-state picture languages
- Some properties of two-dimensional on-line tessellation acceptors
- Some results concerning automata on two-dimensional tapes
- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
- The method of forced enumeration for nondeterministic automata
- There are no fully space constructible functions between log log n and log n
- Three-way automata on rectangular types over a one-letter alphabet
- Three-way tape-bounded two-dimensional Turing machines
- Three-way two-dimensional multicounter automata
- Triangle cellular automata
- Two-dimensional alternating turing machines with only universal states
- Two-dimensional alternative Turing machines
- Two-dimensional finite automata and unacceptable functions
- Two-dimensional multipass on-line tessellation acceptors
- Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
Cited in
(29)- Snake-Deterministic Tiling Systems
- Some results concerning two-dimensional turing machines and finite automata
- scientific article; zbMATH DE number 4037204 (Why is no real title available?)
- scientific article; zbMATH DE number 7770057 (Why is no real title available?)
- Two-Dimensional Limited Context Restarting Automata
- Reversibility of computations in graph-walking automata
- Weighted picture automata and weighted logics
- Two-dimensional automata with rotated inputs (projection-type)
- Relative approximate bisimulations for fuzzy picture automata
- Concatenation operations and restricted variants of two-dimensional automata
- Characterizations of recognizable picture series
- TRANSITIVITY IN TWO-DIMENSIONAL LOCAL LANGUAGES DEFINED BY DOT SYSTEMS
- Regular binoid expressions and regular binoid languages.
- Non-closure property of space-bounded two-dimensional alternating Turing machines
- scientific article; zbMATH DE number 1689049 (Why is no real title available?)
- Three-way two-dimensional alternating finite automata with rotated inputs
- Decision problems and projection languages for restricted variants of two-dimensional automata
- A Nivat theorem for weighted picture automata and weighted MSO logic
- A note on three-dimensional alternating Turing machines with space smaller than \(\log m\)
- On space functions fully constructed by two-dimensional Turing machines
- Plane-walking automata
- Towards more expressive 2D deterministic automata
- Simple picture processing based on finite automata and regular grammars
- Finite state automata representing two-dimensional subshifts
- A Nivat theorem for weighted picture automata and weighted MSO logics
- Two dimensional fuzzy regular languages
- Two-way Automata and Regular Languages of Overlapping Tiles
- A survey on picture-walking automata
- Degrees of restriction for two-dimensional automata
This page was built for publication: A survey of two-dimensional automata theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638801)
