0 votes 0 votes closed as a duplicate of: MadeEasy Subject Test 2019: Theory Of Computation - Pushdown Automata Consider the following PDA: The language accepted by the given PDA is: L = {(b^n a b^n a )^m | m, n >= 0} L = {b^n a b^n a | n >= 0} {bn | n >= 0} L = {b^n a b^n a | n >= 0} L = {(b^n a b^n a )^m | m, n >= 0} {bn | n >= 0} Theory of Computation pushdown-automata theory-of-computation + – Satbir asked Dec 10, 2018 • closed Nov 1, 2019 by Satbir Satbir 444 views comment Share Follow See all 3 Comments See all 3 3 Comments reply Devwritt commented Dec 10, 2018 reply Follow Share there is no transaction with (q0, a, z0), if we put n=0 in all options then there will be aa only and that time top of stack will be z0. So, transaction from initial state with (a ,z0) should be there 0 votes 0 votes Satbir commented Dec 10, 2018 reply Follow Share @Devwritt yes correct .what if , we put a,zo/zo for qo ? 0 votes 0 votes Hemanth_13 commented Dec 10, 2018 reply Follow Share https://gateoverflow.in/276670/madeeasy Check this 0 votes 0 votes Please log in or register to add a comment.