A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- Cite this paper as:
- Anselmo M., Madonia M. (2009) A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages. In: Bozapalidis S., Rahonis G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg
The paper deals with some open questions related to unambiguity, finite ambiguity and complementation of two-dimensional recognizable languages. We give partial answers based on the introduction of special classes of languages of “high complexity”, in a sense specified in the paper and motivated by some necessary conditions holding for recognizable and unambiguous languages. In the last part of the paper we also show a new necessary condition for recognizable two-dimensional languages on unary alphabet.
KeywordsAutomata and Formal Languages Unambiguity Complement Two-dimensional languages
Unable to display preview. Download preview PDF.