On the public citation graph
A survey of two-dimensional automata theory
0 signed · 90 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/scj.4690170708openalex-snapshot
Relationships of accepting powers between cellular space with bounded number of state‐changes and other automata
inferredcites →https://doi.org/10.1002/scj.4690170903openalex-snapshot
Relationship between the accepting powers of (k, l)‐neighborhood template δ‐type one‐dimensional bounded cellular acceptors and other types of two‐dimensional automata
inferredcites →https://doi.org/10.1007/3-540-08442-8_70openalex-snapshot
Environments, Labyrinths and Automata
inferredcites →https://doi.org/10.1007/3-540-10854-8_47openalex-snapshot
One pebble does not suffice to search plane labyrinths
inferredcites →https://doi.org/10.1007/978-3-642-95486-3_35openalex-snapshot
Array Languages and Lindenmayer Systems —A Survey
inferredcites →https://doi.org/10.1007/978-3-7091-8596-4_13openalex-snapshot
On Cellular Automata with a Finite Number of State Changes
inferredcites →https://doi.org/10.1007/bf00264617openalex-snapshot
On real-time cellular automata and trellis automata
inferredcites →https://doi.org/10.1016/0020-0190(73)90011-2openalex-snapshot
Parallel⧸sequential array automata
inferredcites →https://doi.org/10.1016/0020-0190(78)90040-6openalex-snapshot
A note on two-dimensional finite automata
inferredcites →https://doi.org/10.1016/0020-0190(79)90089-9openalex-snapshot
A note on bottom-up pyramid acceptors
inferredcites →https://doi.org/10.1016/0020-0190(80)90151-9openalex-snapshot
A note on decision problems for three-way two-dimensional finite automata
inferredcites →https://doi.org/10.1016/0020-0190(81)90054-5openalex-snapshot
Acceptors for isometric parallel context-free array languages
inferredcites →https://doi.org/10.1016/0020-0190(82)90117-xopenalex-snapshot
A finite 5-pebble-automaton can search every maze
inferredcites →https://doi.org/10.1016/0020-0190(87)90111-6openalex-snapshot
There are no fully space constructible functions between log log n and log n
inferredcites →https://doi.org/10.1016/0020-0255(77)90023-8openalex-snapshot
Some properties of two-dimensional on-line tessellation acceptors
inferredcites →https://doi.org/10.1016/0020-0255(78)90004-xopenalex-snapshot
A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional turing machines
inferredcites →https://doi.org/10.1016/0020-0255(78)90049-xopenalex-snapshot
Cyclic closure properties of automata on a two-dimensional tape
inferredcites →https://doi.org/10.1016/0020-0255(79)90017-3openalex-snapshot
Three-way tape-bounded two-dimensional turing machines
inferredcites →https://doi.org/10.1016/0020-0255(79)90021-5openalex-snapshot
Real-time recognition of two-dimensional tapes by cellular automata
inferredcites →https://doi.org/10.1016/0020-0255(79)90029-xopenalex-snapshot
Three-way two-dimensional multicounter automata
inferredcites →https://doi.org/10.1016/0020-0255(79)90048-3openalex-snapshot
Closure properties of three-way and four-way tape-bounded two-dimensional turing machines
inferredcites →https://doi.org/10.1016/0020-0255(80)90023-7openalex-snapshot
A note on deterministic three-way tape-bounded two-dimensional Turing machines
inferredcites →https://doi.org/10.1016/0020-0255(81)90023-2openalex-snapshot
Pushdown automata on arrays
inferredcites →https://doi.org/10.1016/0020-0255(81)90038-4openalex-snapshot
Relation of one-way parallel/sequential automata to 2-D finite-state automata
inferredcites →https://doi.org/10.1016/0020-0255(85)90041-6openalex-snapshot
Three-way automata on rectangular tapes over a one-letter alphabet
inferredcites →https://doi.org/10.1016/0020-0255(87)90013-2openalex-snapshot
A hierarchy of random-context grammars and automata
inferredcites →https://doi.org/10.1016/0020-0255(88)90005-9openalex-snapshot
A note on three-way two-dimensional alternating Turing machines
inferredcites →https://doi.org/10.1016/0022-0000(80)90008-2openalex-snapshot
Recognition of topological equivalence of patterns by array automata
inferredcites →https://doi.org/10.1016/0022-0000(89)90010-xopenalex-snapshot
Lower bounds for language recognition on two-dimensional alternating multihead machines
inferredcites →https://doi.org/10.1016/0031-3203(86)90058-0openalex-snapshot
T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0146-664x(74)90017-3openalex-snapshot
Pebble automata on arrays
inferredcites →https://doi.org/10.1016/0304-3975(80)90053-5openalex-snapshot
Halting space-bounded computations
inferredcites →https://doi.org/10.1016/0304-3975(83)90048-8openalex-snapshot
Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
inferredcites →https://doi.org/10.1016/0304-3975(83)90093-2openalex-snapshot
Two-dimensional alternating turing machines
inferredcites →https://doi.org/10.1016/0304-3975(89)90154-0openalex-snapshot
Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180°-rotation
inferredcites →https://doi.org/10.1016/0734-189x(84)90134-8openalex-snapshot
Connected pictures are not recognizable by deterministic two-dimensional on-line tessellation acceptors
inferredcites →https://doi.org/10.1016/b978-0-12-386870-1.50027-7openalex-snapshot
A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines
inferredcites →https://doi.org/10.1016/s0019-9958(76)80004-6openalex-snapshot
A region crossing problem for array-bounded automata
inferredcites →https://doi.org/10.1016/s0019-9958(76)80006-xopenalex-snapshot
Some notes on finite-state picture languages
inferredcites →https://doi.org/10.1016/s0019-9958(77)90337-0openalex-snapshot
Extended controlled table L-arrays
inferredcites →https://doi.org/10.1016/s0019-9958(79)90604-1openalex-snapshot
Two-dimensional multipass on-line tessellation acceptors
inferredcites →https://doi.org/10.1016/s0019-9958(80)90164-3openalex-snapshot
One-way bounded cellular automata
inferredcites →https://doi.org/10.1016/s0019-9958(81)90598-2openalex-snapshot
Triangle cellular automata
inferredcites →https://doi.org/10.1016/s0019-9958(82)90572-1openalex-snapshot
Two-dimensional alternating turing machines with only universal states
inferredcites →https://doi.org/10.1016/s0020-0255(80)80023-5openalex-snapshot
Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0022-0000(72)80004-7openalex-snapshot
Real-time language recognition by one-dimensional cellular automata
inferredcites →https://doi.org/10.1051/ita/1984180403071openalex-snapshot
On real time and linear time cellular automata
inferredcites →https://doi.org/10.1080/00207167408803078openalex-snapshot
Array automata and operations on array languages
inferredcites →https://doi.org/10.1080/00207167408803092openalex-snapshot
Some results concerning automata on two-dimensional tapes
inferredcites →https://doi.org/10.1080/00207167908803172openalex-snapshot
Two-dimensional finite automata and unacceptable functions
inferredcites →https://doi.org/10.1109/focs.1965.11openalex-snapshot
Hierarchies of memory limited computations
inferredcites →https://doi.org/10.1109/sfcs.1977.20openalex-snapshot
On the capability of finite automata in 2 and 3 dimensional space
inferredcites →https://doi.org/10.1109/sfcs.1978.30openalex-snapshot
On the power of the compass (or, why mazes are easier to search than graphs)
inferredcites →https://doi.org/10.1109/swat.1969.29openalex-snapshot
Two characterizations of the context-sensitive languages
inferredcites →https://doi.org/10.1109/swat.1971.29openalex-snapshot
Two-dimensional formal languages and pattern recognition by cellular automata
inferredcites →https://doi.org/10.1109/t-c.1974.223995openalex-snapshot
On Some Open Problems in the Theory of Cellular Automata
inferredcites →https://doi.org/10.1109/tc.1981.1675797openalex-snapshot
Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages
inferredcites →https://doi.org/10.1109/tpami.1981.4767048openalex-snapshot
Parallel Image Processing by Memory-Augmented Cellular Automata
inferredcites →https://doi.org/10.1145/321495.321508openalex-snapshot
Some Results on Tape-Bounded Turing Machines
inferredcites →https://doi.org/10.1145/321694.321701openalex-snapshot
One-Pass Complexity of Digital Picture Properties
inferredcites →https://doi.org/10.1145/800135.804417openalex-snapshot
Fast parallel processing array algorithms for some graph problems(Preliminary Version)
inferredcites →https://doi.org/10.21236/ada042156openalex-snapshot
Cellular Pyramids for Image Analysis.
inferredcites →https://doi.org/10.5555/40369.40374openalex-snapshot
Normed two-plane traps for finite systems of cooperating compass automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_65openalex-snapshot
Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_69openalex-snapshot
Some results concerning two-dimensional turing machines and finite automata
inferred← citeshttps://doi.org/10.1007/978-3-319-13749-0_14openalex-snapshot
Solving 2D-Pattern Matching with Networks of Picture Processors
inferred← citeshttps://doi.org/10.1007/978-3-540-30499-9_113openalex-snapshot
Local and Recognizable Iso Picture Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_33openalex-snapshot
On the Complexity of Unary Tiling-Recognizable Picture Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-75414-5_7openalex-snapshot
Recognizable vs. Regular Picture Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-03745-0_14openalex-snapshot
Networks of Evolutionary Picture Processors with Filtered Connections
inferred← citeshttps://doi.org/10.1007/bfb0023754openalex-snapshot
The expressive power of transitive closure and 2-way multihead automata
inferred← citeshttps://doi.org/10.1007/bfb0033246openalex-snapshot
Character recognition with k-head finite array automata
inferred← citeshttps://doi.org/10.1007/s00026-009-0018-9openalex-snapshot
On the Tiling System Recognizability of Various Classes of Convex Polyominoes
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00228-qopenalex-snapshot
On space functions fully constructed by two-dimensional turing machines
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90068-jopenalex-snapshot
Some remarks on two-dimensional finite automata
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90110-topenalex-snapshot
A hierarchy result for 2-dimensional TM's operating in small space
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90114-nopenalex-snapshot
Two-dimensional on-line tessellation acceptors are not closed under complement
inferred← citeshttps://doi.org/10.1016/0304-3975(92)00010-oopenalex-snapshot
Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
inferred← citeshttps://doi.org/10.1023/a:1024087118762openalex-snapshot
Parallel Grammars: A Phenomenology
inferred← citeshttps://doi.org/10.1109/csss.2012.474openalex-snapshot
Comparison of Two-Way Two-Dimensional Finite Automata and Three-Way Two-Dimensional Finite Automata
inferred← citeshttps://doi.org/10.20868/upm.thesis.37206openalex-snapshot
Modelo de computación conexionista inspirado en las redes de procesadores evolutivos y su aprendizaje
inferred← citeshttps://doi.org/10.22215/etd/2017-12063openalex-snapshot
Foraging in the Presence of Obstacles
inferred← citeshttps://doi.org/10.46298/dmtcs.511openalex-snapshot
Deterministic recognizability of picture languages with Wang automata
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.