0 votes 0 votes Construct an npda that accepts the language generated by the grammar $S → aSSS|ab$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation pushdown-automata npda + – Naveen Kumar 3 asked Jun 22, 2019 Naveen Kumar 3 306 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 𝛿( q0 , λ , z0) → ( q1 , Sz0 ) 𝛿( q1,a,S)→ { ( q1 , SSS ) , ( q1, B ) } 𝛿( q1,b,B)→ (q1,λ) 𝛿( q1,λ,z0)→ (qf,z0) JAINchiNMay answered Nov 12, 2020 • edited Nov 12, 2020 by JAINchiNMay JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.
