The Gateway to Computer Science Excellence
+1 vote
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack.

DPDA with empty stack accepts LR(0) grammar.

Can someone explain in depth/or give good reference links?
in Theory of Computation by Active (2.3k points) | 49 views

read the references of Compiler Design in sequence, you will understood some basics behind it 

( i hope it helps )

prefix property makes DPDA with empty stack weak

Please log in or register to answer this question.

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,737 questions
57,355 answers
105,249 users