GATE CSE
First time here? Checkout the FAQ!
x
0 votes
85 views

Can the NPDA constructed to accept L, such that L = L1 U L, L1 = {1n 0n | n > 0} and L2 = {0n 12n | n > 0} be drawn like this?

This is an informal representation of NPDA. Is this correct?

Or should the NPDA accepting language L should have 2 final states? 

asked in Theory of Computation by Active (1.2k points)  
retagged by | 85 views

1 Answer

0 votes

CFL is closed under union and both L1 and L2 are DCFL so L is CFL.

Now second point is ,your rough state transition diagram correct or not. No its NOT correct , in this diagram you considered L1= {0n 1n | n>0}

answered by Active (1.8k points)  


Top Users Jul 2017
  1. Bikram

    3946 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1842 Points

  4. joshi_nitish

    1650 Points

  5. Arjun

    1268 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1100 Points

  8. Shubhanshu

    1052 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    692 Points


24,016 questions
30,946 answers
70,303 comments
29,333 users