The Gateway to Computer Science Excellence
0 votes
is it possible with deterministic PDA?
in Theory of Computation by Active (2.8k points) | 407 views

1 Answer

+4 votes
Best answer

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.

by Boss (12.8k points)
selected by
but if theres no 'b', as m≥0
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
if no 'b' 's directly go to the next state that is where 'c' is defined then perform remaing opeartions.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
104,682 users