1 votes 1 votes Find an npda with two states for the language $L =$ {$a^nb^{n+1} : n ≥ 0$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation pushdown-automata npda + – Naveen Kumar 3 asked Jun 22, 2019 Naveen Kumar 3 1.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Acceptance by empty stack. Ravijha answered Jun 22, 2019 Ravijha comment Share Follow See 1 comment See all 1 1 comment reply JAINchiNMay commented Nov 12, 2020 reply Follow Share is the transition (b,z0,zo) required?? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 𝛿( q0 , λ , z) → ( q0 , Sz1 ) 𝛿( q0,a,S)→ { ( q0 , SB ) } 𝛿( q0,b,S)→ (q0,λ) 𝛿( q0,b,B)→ (q0,λ) 𝛿( q0,λ,z1)→ (q0,λ) JAINchiNMay answered Nov 12, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.
