Some properties of two-dimensional on-line tessellation acceptors
From MaRDI portal
Publication:1244324
DOI10.1016/0020-0255(77)90023-8zbMath0371.94067MaRDI QIDQ1244324
Publication date: 1977
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(77)90023-8
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68T10: Pattern recognition, speech recognition
03D05: Automata and formal grammars in connection with logical questions
Related Items
A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines, A note on bottom-up pyramid acceptors, Two-dimensional alternative Turing machines, A computational model for tiling recognizable two-dimensional languages, A note on time-bounded bottom-up pyramid cellular acceptors, Deterministic and unambiguous two-dimensional languages over one-letter alphabet, Characterizations of recognizable picture series, Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors, Two-dimensional automata with rotated inputs (projection-type), Three-way two-dimensional finite automata with rotated inputs, A hierarchy of random-context grammars and automata, A note on three-way two dimensional alternating Turing machines, Three-dimensional alternating Turing machines with only universal states, A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines, Cyclic closure properties of automata on a two-dimensional tape, Three-way tape-bounded two-dimensional Turing machines, Three-way two-dimensional multicounter automata, Real-time recognition of two-dimensional tapes by cellular automata, A remark on two-dimensional finite automata, A note on deterministic three-way tape-bounded two-dimensional Turing machines, Two-dimensional automata with rotated inputs, Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure, A note on rebound automata, A note on three-dimensional finite automata, Two-dimensional on-line tessellation acceptors are not closed under complement, Three-dimensional connected pictures are not recognizable by finite-state acceptors, A note on two-dimensional finite automata, Two-dimensional cellular automata recognizer, A note on three-dimensional alternating Turing machines with space smaller than \(\log m\), Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata, Context-sensitive string languages and recognizable picture languages, Recognizable picture languages and domino tiling, Two-dimensional cellular automata and deterministic on-line tessalation automata, Two-dimensional connected pictures are not recognizable by finite-state acceptors, Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\(\circ\)-rotation, Pictures of functions and their acceptability by automata, EMSO-logic and automata related to homogeneous flow event structures, A SAT-based parser and completer for pictures specified by tiling, Tile rewriting grammars and picture languages, New operations and regular expressions for two-dimensional languages over one-letter alphabet, Three-way two-dimensional alternating finite automata with rotated inputs, Picture languages: tiling systems versus tile rewriting grammars., Random context structure grammars and automata - a formal approach, A survey of two-dimensional automata theory, Snake-Deterministic Tiling Systems, Unambiguous recognizable two-dimensional languages, Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages, Tiling Recognizable Two-Dimensional Languages, Recognizable vs. Regular Picture Languages, Deterministic Two-Dimensional Languages over One-Letter Alphabet
Cites Work
