Descriptional complexity of bounded context-free languages


Finite-turn pushdown automata (PDA) are investigated concerning their descriptional complexity. It is known that they accept exactly the class of ultralinear contextfree languages. Furthermore, the increase in size when converting arbitrary PDAs accepting ultralinear languages to finite-turn PDAs cannot be bounded by any recursive function. The latter… (More)
DOI: 10.1007/978-3-540-73208-2_30


1 Figure or Table

Cite this paper

@inproceedings{Malcher2007DescriptionalCO, title={Descriptional complexity of bounded context-free languages}, author={Andreas Malcher and Giovanni Pighizzini}, booktitle={Developments in Language Theory}, year={2007} }