{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw2 - is not empty is undecidable using(i Rice theorem(ii A...

This preview shows page 1. Sign up to view the full content.

CSE860 HW 2. Due Feb. 17 1. Construct "and-or" graph for the following CFG G and Using this graph, decide (i) if L(G) is empty or not, and (ii) if L(G) is finite or not. G: S -> AB| CA B -> BC | AB A -> a C -> aB | b 2. Solve 3.6 3. Solve 3.7 4. Solve 4.10 5. Solve 5.2 6. Solve 5.3 7. Solve 5.7 8. Show that L = { <M> | M is a TM and L(M)
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: is not empty} is undecidable using (i) Rice theorem (ii) A direct reduction without using the Rice theorem. 9. Show that the following problem about programs in a real programming language is undeciable: " Whether two programs produce the same output on all inputs."...
View Full Document

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern