论文信息 - A Characterization of Recognizable Picture Languages

A Characterization of Recognizable Picture Languages

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.

Katsushi Inoue | Itsuo Takanami

[1] Katsushi Inoue,et al. Nonclosure Properties of Two-Dimensional On-Line Tessellation Acceptors and One Way Parallel Sequential Array Acceptors , 1977 .

[2] M. Blum,et al. Automata on a 2-Dimensional Tape , 1967, SWAT.

[3] Katsushi Inoue,et al. Some properties of two-dimensional on-line tessellation acceptors , 1977, Inf. Sci..

[4] Antonio Restivo,et al. Recognizable Picture Languages , 1992, Int. J. Pattern Recognit. Artif. Intell..

[5] Azriel Rosenfeld,et al. Picture languages: Formal models for picture recognition , 1979 .

[6] Katsushi Inoue,et al. Two-dimensional finite automata and unacceptable functions , 1979 .

[7] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[8] Katsushi Inoue,et al. A survey of two-dimensional automata theory , 1991, Inf. Sci..