MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Separation Results for Rebound Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Hiding Functions and Computational Security of Image Watermarking Systems
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Characterizations of recognizable picture series
Theoretical Computer Science
A SAT-based parser and completer for pictures specified by tiling
Pattern Recognition
Picture Languages: From Wang Tiles to 2D Grammars
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
A computational model for tiling recognizable two-dimensional languages
Theoretical Computer Science
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
A note on alternating one-pebble Turing machines with sublogarithmic space
Information Processing Letters
Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure
Information Sciences: an International Journal
From determinism to non-determinism in recognizable two-dimensional languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Tiling automaton: a computational model for recognizable two-dimensional languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Tiling recognizable two-dimensional languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Deterministic two-dimensional languages over one-letter alphabet
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Fundamenta Informaticae
Synchronized alternating turing machines on four-dimensional input tapes
WSEAS Transactions on Computers
WSEAS Transactions on Computers
Four-dimensional synchronized alternating turing machines
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
A brief excursion inside the class of tiling recognizable two-dimensional languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Marker versus inkdot on four-dimensional tapes
ICOSSSE'10 Proceedings of the 9th WSEAS international conference on System science and simulation in engineering
Towards more expressive 2D deterministic automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Weighted picture automata and weighted logics
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Nested pebbles and transitive closure
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Regular expressions for two-dimensional languages over one-letter alphabet
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the computation power of finite automata in two-dimensional environments
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Bottom-up pyramid cellular acceptors with four-dimensional layers
Artificial Life and Robotics
Cooperating systems of four-dimensional finite automata
Artificial Life and Robotics
Iso-array acceptors and learning
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Online tessellation automaton recognizing various classes of convex polyominoes
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Three-way two-dimensional alternating finite automata with rotated inputs
Information Sciences: an International Journal
A survey on picture-walking automata
Algebraic Foundations in Computer Science
Simulating two-dimensional recognizability by pushdown and queue automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Two-dimensional sgraffito automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Inference of Parsable Graph Grammars for Syntactic Pattern Recognition
Fundamenta Informaticae
Pebble Automata. Figures Families Recognition and Universality
Fundamenta Informaticae - Cellular Automata
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
Fundamenta Informaticae
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Comparing two-dimensional one-marker automata to sgraffito automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
This paper explains our approach to the problem of pattern recognition by serial computer. The rudimentary theory of vision presented here lies within the framework of automata theory. Our goal is to classify the types of patterns that can be recognized by an automaton that scans a finite 2-dimensional tape. For example, we would like to know if an automaton can decide whether or not a given pattern on a tape forms a connected region. Although we have solved a number of problems, we have failed to solve this connectedness problem. This paper merely begins to describe the action of automata in higher dimensions. Our goal now is to generalize the theory presented here and make it applicable to a wide variety of pattern-recognizing machines.