Paper Info
Title
A characterization of recognizable picture languages
Abstract
This paper first shows that REC, the family of recognizable picture languages in Giammarresi and Restivo (1991), is equal to the family of picture languages accepted by two-dimensional on-line tessellation acceptors in Inoue and Nakamura (1977). By using this result, we then solve open problems in Giammarresi and Restivo (1991), and show that (i) REC is not closed under complementation, and (ii) REC properly contains the family of picture languages accepted by two-dimensional nondeterministic finite automata even over a one letter alphabet.
Year
DOI
Venue
1992
10.1142/S0218001494000255
International Journal of Pattern Recognition and Artificial Intelligence
Keywords
DocType
Volume
recognizable picture languages,recognizable picture language,nondeterministic finite automata
Conference
8
Issue
ISSN
ISBN
2
0302-9743
981-02-1866-4
Citations 
PageRank 
References 
27
1.86
5
Authors
2
Name
Order
Citations
PageRank
Katsushi Inoue151574.43
Itsuo Takanami237953.99