'Empty strings' presentation slideshows

Non-Context-Free Languages

Non-Context-Free Languages. Lecture 10 Section 2.3 Fri, Oct 13, 2006. Non-Context-Free Languages. It turns out that not all languages are context-free. An example of a non-context-free language is { a n b n c n | n ? 0}. To process this would require two stacks. The Pumping Lemma.

526 views • 30 slides

CSC 4630

343 views • 21 slides

Lecture # 2

Lecture # 2. An Important language. PALINDROME The language consisting of ? and the strings s defined over ? such that Rev(s)=s. It is to be denoted that the words of PALINDROME are called palindromes. Example : For ? ={a,b}, PALINDROME={ ? , a, b, aa, bb, aaa, aba, bab, bbb, ...}.

328 views • 19 slides