A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages

  • Marcella Anselmo
  • Maria Madonia
Conference paper

DOI: 10.1007/978-3-642-03564-7_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5725)
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

Abstract

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.

Keywords

Automata and Formal Languages Unambiguity Complement Two-dimensional languages 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Marcella Anselmo
    • 1
  • Maria Madonia
    • 2
  1. 1.Dipartimento di Informatica ed ApplicazioniUniversità di SalernoFiscianoItaly
  2. 2.Dip. Matematica e InformaticaUniversità di CataniaCataniaItaly

Personalised recommendations