1. (15%) Write grammars (not limited to regular grammars) for the following languages: (a) L = { "b"+2 n20} (b) L = { an

[answerhappygod]

1 15 Write Grammars Not Limited To Regular Grammars For The Following Languages A L B 2 N20 B L An 1 (39.45 KiB) Viewed 57 times

1. (15%) Write grammars (not limited to regular grammars) for the following languages: (a) L = { "b"+2 n20} (b) L = { anb2n. n 2 1} (c) L = {w: wea* and lwl mod 3 = 1} 2. (10%) Find the nfa with one single final state that accepts the following languages represented by regular expressions: (a) L(ab* + b*b) (b) Laa*b+ (ba)*) 3. (10%) For the language L on {a, b}, if all strings in L contain an even number of a's (a) Show the dfa that accepts the language (b) Construct a right-linear grammar based on the above dfa