Computer Science – Computational Complexity
Scientific paper
2008-08-29
Computer Science
Computational Complexity
Version 2: minor chages associated with typos; slight changes of title, abstract, and introduction (letter size, 13 pages, 4 f
Scientific paper
In formal language theory, one of the most fundamental tools, known as pumping lemmas, is extremely useful for regular and context-free languages. However, there are natural properties for which the pumping lemmas are of little use. One of such examples concerns a notion of advice, which depends only on the size of an underlying input. A standard pumping lemma encounters difficulty in proving that a given language is not regular in the presence of advice. We develop its substitution, called a swapping lemma for regular languages, to demonstrate the non-regularity of a target language with advice. For context-free languages, we also present a similar form of swapping lemma, which serves as a technical tool to show that certain languages are not context-free with advice.
No associations
LandOfFree
Swapping Lemmas for Regular and Context-Free Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Swapping Lemmas for Regular and Context-Free Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Swapping Lemmas for Regular and Context-Free Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-543861