Talk About Network

Google


Register and Login
Nick
Password
Register create new account Sign up is FREE and you can post replies, new topics, bookmark posts and more!
Recover lost password


Education > Homework, comp. sci. > formal language
Latest [ Topics | Posts ] Archive Post A New Topic Post a Reply
<< Topic < Post Post 1 of 1 Topic 9 of 33
Post > Topic >>

formal language

by "Chris" <el02028@[EMAIL PROTECTED] > Apr 16, 2004 at 01:25 PM

I have to prove that the language : " S->aSSb | e " cannot be represented
by
a linear context free language which is a language that has only one
non-terminal symbol on the right side. Any help?
 




 1 Posts in Topic:
formal language
"Chris" <el0  2004-04-16 13:25:45 

Post A Reply:
  Go here to Signup

AddThis Feed Button


About - Advertising - Contact - Frequently Asked Questions - Privacy Policy - Terms of Use - Signup

Contact
tan12V112 Mon Dec 1 18:36:59 CST 2008.