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. © 2009 Springer.
CITATION STYLE
Anselmo, M., & Madonia, M. (2009). A note on unambiguity, finite ambiguity and complementation in recognizable two-dimensional languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5725 LNCS, pp. 147–159). https://doi.org/10.1007/978-3-642-03564-7_9
Mendeley helps you to discover research relevant for your work.