Question: please do those questions D2L Bright space 1. Consider the language for 12 f m LB (a Prove that LB is not regular. You may
D2L Bright space 1. Consider the language for 1"2 f m LB (a Prove that LB is not regular. You may use the pumping lemma and closure properties for regular languages. (b) Give a Context-Free Grammar for LB 2. Consider the following Context-Free Grammar: A alas I BAA Give parse trees and leftmost derivations for each of the following strings. (a) ababba (b) aaabbb (c) baaalbab 3. Design context-free grammars that generate each of the following languages (all over the alphabet (0,1) (a) w E (0,1) where w has odd length and its first, last, and middle symbols are the same (b) (0"1" n m +2)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
