Abstract
It doesn’t matter whether we take NPDAs to accept by empty stack or by final state; the two methods of acceptance are equivalent in the sense that each type of machine can simulate the other. Given an arbitrary NPDA M that accepts by final state or empty stack, we will show how to construct an equivalent NPDA M’ with a single accept state for which acceptance by empty stack and by final state coincide.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1997). Final State Versus Empty Stack. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1844-9_28
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1844-9_28
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7309-7
Online ISBN: 978-1-4612-1844-9
eBook Packages: Springer Book Archive