Akshat Sinhal @akshatsinhal007 added a Question 7 Sep 2017 Can PDA have two final states. can pda has accept two states ? 1Comment thumbs up down up0 like V Vaishali @vaishalij 7 Sep 2017 07:53 pm Yes a pda can have two accepting/final states. If you look at the Formal definition of a PDA, A PDA is formally defined as a 7-tuple: where is a finite set of states is a finite set which is called the input alphabet is a finite set which is called the stack alphabet is a finite subset of , the transition relation. is the start state is the initial stack symbol is the set of accepting states F is the set of accepting states, that means it can be any number of accepting states but should be a subset of Q. up1 liked Log in or register to post comments

Yes a pda can have two accepting/final states. If you look at the Formal definition of a PDA,

A PDA is formally defined as a 7-tuple:

where

is a finite set of

statesinput alphabetstack alphabettransition relation.start stateinitial stack symbolaccepting statesF is the set of accepting states, that means it can be any number of accepting states but should be a subset of Q.