NPDA for accepting the language L = {an bn cm | m,n>=1}
Problem
L = { abc, abcc, abccc, aabbc, aaabbbcc, aaaabbbbccccc, ...... }
Explanation –
= { a, z }
Approach used in the construction of PDA –
Stack transition functions –
(q0, a, z) (q0, az)
(q0, a, a) (q0, aa)
(q0, b, a) (q1, )
(q1, b, a) (q1, )
(q1, c, z) (qf, z )
(qf, c, z) (qf, z )
Contact Us