0 votes 0 votes Dpda acceptance by empty stack is equivalent in power as dpda acceptance by final state? explain Theory of Computation theory-of-computation + – Nancy Pareta asked Jul 25, 2018 Nancy Pareta 1.2k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments srestha commented Jul 25, 2018 reply Follow Share regular languages which dont follow prefix property can u elaborate this line? 0 votes 0 votes Shubham Shukla 6 commented Jul 25, 2018 i edited by Shubham Shukla 6 Jul 25, 2018 reply Follow Share @nancy pareta well.saying that i think wont be correct...:( 0 votes 0 votes Shubham Shukla 6 commented Jul 25, 2018 reply Follow Share @srestha see this link https://gateoverflow.in/135555/prefix-property you will get it easily.! 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Yes, Because if for a language dpda will exist with acceptance by empty stack then for the same language we can also give dpda with acceptance by final state. Sachin1696 answered Jul 25, 2018 Sachin1696 comment Share Follow See all 4 Comments See all 4 4 Comments reply Nancy Pareta commented Jul 25, 2018 reply Follow Share Give me a dpda diagram of Regular Language { a, ab } with empty stack acceptance? and same with final state acceptance? 0 votes 0 votes Sachin1696 commented Jul 25, 2018 reply Follow Share why you are constructing PDA for Regular Language??? 0 votes 0 votes Sachin1696 commented Jul 25, 2018 reply Follow Share dpda diagram of CFL with empty stack acceptance and same with final state acceptance. 0 votes 0 votes MrPeppermint commented Jul 25, 2018 reply Follow Share https://gateoverflow.in/148101/prefix-property-and-dpda?show=148101 https://gateoverflow.in/165012/deterministic-pushdown-automata-prefix-property https://gateoverflow.in/377/gate1999-1-6 0 votes 0 votes Please log in or register to add a comment.
