0 0 votes closed with the note: Doubt resolved Consider the following statement: S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property. Please explain as why this sentence is wrong.... Theory of Computation theory-of-computation pushdown-automata dpda + – shivangi5 760 views comment Share Follow Print See all 3 Comments 3 3 Comments reply abhishek tiwary commented Dec 1, 2017 i edited by abhishek tiwary Dec 1, 2017 reply Follow flag language who have prefix property definitely accepted by empty stack 0 0 replyShare Shivam Chauhan commented Dec 1, 2017 reply Follow flag Sentence seems correct. @abhishek+tiwary Describe a language accepted by DPDA empty stack and not following prefix propoerty. 0 0 replyShare abhishek tiwary commented Dec 1, 2017 reply Follow flag @ Shivam Chauhan i interpreted in wrong way those who do not have prefix not accepted by empty stack 0 0 replyShare Please log in or register to add a comment.
