Three question about computer science in Automata, Languages And Computation

Cancelled Posted 7 years ago Paid on delivery
Cancelled Paid on delivery

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

Automotive Computer Support Java

Project ID: #11807538

About the project

3 proposals Remote project Active 7 years ago

3 freelancers are bidding on average $296 for this job

usamamw141

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)
1.4
abhishekrasdev

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)
0.0