The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
108 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.5k points)
retagged by | 108 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 Boss (7.4k points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,154 questions
36,975 answers
92,133 comments
34,816 users