Logic for Unambiguous Context-Free Languages

Yassine Hachaïchi (1)

1 LR-LAMSIN-ENIT - Laboratoire de Modélisation Mathématique et Numérique dans les Sciences de l'Ingénieur [Tunis]

We give in this paper a logical characterization for unambiguous Context Free Languages, in the vein of descriptive complexity. A fragment of the logic characterizing context free languages given by Lautemann, Schwentick and Thérien [18] based on implicit definability is used for this aim. We obtain a new connection between two undecidable problems, a logical one and a language theoretical one.

Mots clés: Descriptive complexity; Language theory

Domaines: Mathématique discrète [cs.DM]; Complexité [cs.CC]

Yassine Hachaïchi. Logic for Unambiguous Context-Free Languages. International Journal of Computer Science Theory and Application, 2016, 5 (1), pp.12-19. ⟨hal-01298965v2⟩