proof of non context-free languages!!sos!!
Date: 30 Nov 2004 10:34:54 -0800
i i had to prove that some languages are non context-free by using the
theorem of intersection and the pumping lemma..iam stuck on these
languages:
1)a^n,n=1,2,3,5,7,11,13..
2)a^n^2,n>=0
9)www:w is {a,b}*
If anyone can help , i would appreciate it!thanks
Relevant Pages
- Help with inserting a blank line on condition
... I've been programming in other languages but am very new to VB and still getting used to its syntax style - so I'm stuck with the simplest of problems. ...
(microsoft.public.excel.programming) - Re: pumping lemma for CFL
... >> resulting string is in L. ... > This is the pumping lemma for regular languages. ...
(sci.math) - German Capital
... Does Luther enter in that Picture? ... Why has it stuck to it? ... Did other Languages follow that Tradition some Time? ...
(sci.lang) - Re: Speech Recognition: why not so popular?
... Wes Groleau wrote: ... I am still stuck at V7.3 since I need it in 3 languages. ... SR in another language as your mother tongue is a hard quality test!) ...
(comp.sys.mac.system) - Re: Where does the drive to syntax come from?
... of this are really that good computer languages must work in the intersection of the two sets. ... Neither must they fight with the computer nor with the person. ... My nit to pick with this is that, since we design and make the computers, we can change them, so it is possible to modify the computers and/or our interface to them (programming languages) while it is not possible to change the innate cognitive abilities of human beings. ...
(comp.lang.lisp) |
|
