Question: Let A = L(G 1 ) where G 1 is defined in Problem 2.55. Show that A is not a DCFL.Assume that A is a

Let A = L(G1) where G1 is defined in Problem 2.55. Show that A is not a DCFL.Assume that A is a DCFL and consider its DPDA P. Modify P so that its input alphabet is {a, b, c}. When it first enters an accept state, it pretends that c’s are b’s in the input from that point on. What language would the modified P accept?


Problem 2.55.

Let G1 be the following grammar that we introduced in Example 2.45. Use the DK-test to show that G1 is not a DCFG.

R → S | T

S → aSb | ab

T → aT bb | abb

Step by Step Solution

3.26 Rating (161 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

A L G 1 is not a DC FL because it is not context free The DK test can be ... View full answer

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 Introduction theory computation Questions!