0 votes 0 votes is it possible with deterministic PDA? Nit9 asked Dec 4, 2016 Nit9 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes yes,it is possible with DPDA. push all 'a' s into the stack. whenevr 'b' comes change to next state and skip all 'b' s. and 'c' encounters when 'a' is on top of the stack pop it from stack.finally whenever it sees $\epsilon$ it accept the string. santhoshdevulapally answered Dec 4, 2016 selected Dec 4, 2016 by focus _GATE santhoshdevulapally comment Share Follow See all 3 Comments See all 3 3 Comments reply Nit9 commented Dec 4, 2016 reply Follow Share but if theres no 'b', as m≥0 0 votes 0 votes Nit9 commented Dec 4, 2016 reply Follow Share should (c,a/E) be on the same transition as skip b to next state say q1 and then again define (c,a/E) on q1 for the case if the previous transition was due to b 0 votes 0 votes santhoshdevulapally commented Dec 4, 2016 reply Follow Share if no 'b' 's directly go to the next state that is where 'c' is defined then perform remaing opeartions. c,a/$\epsilon$ 1 votes 1 votes Please log in or register to add a comment.