GATE CSE
First time here? Checkout the FAQ!
x
0 votes
58 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)   | 58 views

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.


Top Users Apr 2017
  1. akash.dinkar12

    3518 Points

  2. Divya Bharti

    2558 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1608 Points

  8. Arunav Khare

    1464 Points

  9. Arjun

    1430 Points

  10. Kapil

    1424 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,047 answers
63,238 comments
24,137 users