Abstract
The paper deals with the class REC of recognizable picture languages, UREC its unambiguous variant and co-REC the complement class of REC. The aim of this paper is two-fold:First, the paper focuses on some necessary conditions for a language to be recognizable. Such conditions have already been identified in several works [1–5]. Here, we revisit them in the light of communication complexity arguments.Second, we use communication complexity measures in order to construct a language which is a recognizable and co-recognizable language but not an unambiguous one. This answers a question raised in [6].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
