Three question about computer science in Automata, Languages And Computation

Q1:Let L1 = { w∈ {a,b}*: w ends with the pattern aaaa or |w| is even or w contains the substring abb }. Find a right-linear grammar G1 = ( V, T = {a,b}, S, P ) that generates L1.

Q2:(a) Show that the following context-free grammar G2 is ambiguous. (b) Then find an equivalent cfg G3 that is not ambiguous.

G2 = ( V = {S,A,B,T}, T = {a,c}, S, P ), where the productions P are defined by:

S → AB

A → AA | a | ac

B →Tc

T →aT | a

Q3 in upload file

Skills: Automotive, Computer Help, Java

See more: types programming languages pdf, types programming languages, mcq question science, science multiple choice question, science question writer, primary science question answer, multiple choice question science, computer science question answers

About the Employer:
( 11 reviews ) northridge, United States

Project ID: #11807538

3 freelancers are bidding on average $296 for this job


Hi there, I can provide you the solution. The solution will be solved be my teacher who is Phd student and currently teaching in my University. Thank you

$250 USD in 1 day
(1 Review)
$250 USD in 1 day
(1 Review)

Dear Employer, I have reviewed your job description and I am very confident to meet all your expectation as per my past experience. Below is my response preparation for your requirement- About the requirement More

$388 USD in 10 days
(0 Reviews)