26 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?