Logic for Unambiguous Context-Free Languages
Formal Languages and Automata Theory
2016-04-15 v1 Computational Complexity
Discrete Mathematics
Logic in Computer Science
Abstract
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\'erien [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.
Keywords
Cite
@article{arxiv.1604.04139,
title = {Logic for Unambiguous Context-Free Languages},
author = {Yassine Hachaïchi},
journal= {arXiv preprint arXiv:1604.04139},
year = {2016}
}