Question: You probably remember this little language. = {a, b} L = {ab, aab, aaab, . . .} 1 Its not super exciting

You probably remember this little language. • Σ = {a, b} • L = {ab, aab, aaab, . . .} 1 It’s not super exciting and definitely a regular language. That doesn’t mean we can’t provide a context free grammar for it, though. First, provide a context free grammar for this language that is *not* also a regular (remember that every regular grammar is context free but not vice versa). Then, explain why it is context free but not regular (to do this you will have to talk about the shape of the rules you use).


Step by Step Solution

3.55 Rating (155 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!