Abstract
We have shown that every CFL is accepted by some NPDA. Now we show conversely that NPDAs accept only CFLs. Thus NPDAs and CFGs are equivalent in expressive power. We will do this in two steps by showing that
-
i
every NPDA can be simulated by an NPDA with one state; and
-
ii
every NPDA with one state has an equivalent CFG.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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). Simulating NPDAs by CFGs. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1844-9_30
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1844-9_30
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