Papers
Topics
Authors
Recent
Search
2000 character limit reached

Logic for Unambiguous Context-Free Languages

Published 13 Apr 2016 in cs.FL, cs.CC, cs.DM, and cs.LO | (1604.04139v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Yassine Hachaïchi 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up