Abstract
This paper first shows that REC, the family of recognizable picture languages in Giammarresi and Restivo,3 is equal to the family of picture languages accepted by two-dimensional on-line tessellation acceptors in Inoue and Nakamura.5 By using this result, we then solve open problems in Giammarresi and Restivo,3 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Pattern Recognition and Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
