64 635
Assignments Done
Successfully Done
In September 2018

Answer to Question #38614 in Other Math for Sujata Roy

Question #38614
Given an arbitrary context free grammar G, we define L as below.
L=(0+1)* if G is ambiguous
L=j if G is not ambiguous
Which of the following is true?
a. L is a context-free language
b. L is recursive but not r.e.
c. What L is depends on whether we can determine if G is ambiguous or not
d. What L is is undecidable
Expert's answer

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!


Assignment Expert
31.01.14, 19:10

Dear Sujata Roy.

You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!

Sujata Roy
30.01.14, 07:17

Thank you.

Leave a comment

Ask Your question

Privacy policy Terms and Conditions