Question: 2 a) Consider the language: L={ww=anbm,n1,m2} Determine whether or not the language is regular. If it is, write a: 1. Finite state automaton accepting it.

 2 a) Consider the language: L={ww=anbm,n1,m2} Determine whether or not the

2 a) Consider the language: L={ww=anbm,n1,m2} Determine whether or not the language is regular. If it is, write a: 1. Finite state automaton accepting it. 2. Regular grammar generating it. If it is not (regular) explain in details why it is not so. [4+4] b) Consider the following context free language (CFL) {ambncnm>0 and even, n>0 and odd } Write the corresponding context free grammar (CFG) generating it

Step by Step Solution

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 Databases Questions!