On some recognizable picture-languages [chapter]

Klaus Reinhardt
1998 Lecture Notes in Computer Science  
We show that the language of pictures over fa; bg, where all occurring b's are connected is recognizable, which solves an open problem in Mat98]. We generalize the used construction to show that monocausal deterministically recognizable picture languages are recognizable, which is surprisingly nontrivial. Furthermore we show that the language of pictures over fa; bg, where the number of a's is equal to the number of b's is nonuniformly recognizable.
doi:10.1007/bfb0055827 fatcat:jkoijn4tdne6lkpo53pumcwqqa