Parallel generation of finite images
International Journal of Pattern Recognition and Artificial Intelligence
Journal of Algorithms
On logics, tilings, and automata
Proceedings of the 18th international colloquium on Automata, languages and programming
Recognizable picture languages
Parallel image processing
Picture Languages: Formal Models for Picture Recognition
Picture Languages: Formal Models for Picture Recognition
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A Survey of Two-Dimensional Automata Theory
Proceedings of the 5th International Meeting of Young Computer Scientists on Machines, Languages, and Complexity
A Characterization of Recognizable Picture Languages
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Automata on a 2-dimensional tape
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
| Hi-index | 0.00 |
The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with respect to different kinds of operations. From this, we derive that some natural families of two-dimensional languages (finite languages, regular languages, locally testable languages) are recognizable. Further we give some necessary conditions for recognizability which provides tools to show that certain languages are not recognizable. Although REC shares several properties of recognizable string languages, however, differently from the case of words, we prove here that REC is not closed under complementation and that the emptyness problem is undecidable for this family of languages. Finally, we report some characterizations of family REC by means of machine-based models and logic-based formalisms.