Derivation-bounded languages. (English) Zbl 0176.16703

Full Text: DOI


[1] Banerji, R. B., Phrase structure languages, finite machines and channel capacity, Inform. Control, 6, 153-162 (1963) · Zbl 0115.37008
[2] Bar-Hillel, Y.; Perles, M.; Shamir, E., On formal properties of simple phrase structure grammars, Z. Phonetik, Sprachwissen. Kommunikationsforsch., 14, 143-172 (1961) · Zbl 0106.34501
[3] Ginsburg, S., (The Mathematical Theory of Context-Free Languages (1966), McGraw-Hill Book Company: McGraw-Hill Book Company New York) · Zbl 0184.28401
[5] Ginsburg, S.; Spanier, E. H., Finite-turn pushdown automata, SIAM J. Control, 4, 429-453 (1966) · Zbl 0147.25302
[6] Ginsburg, S.; Spanier, E. H., Control sets on grammars, Mathematical Systems Theory, Vol. 2, 159-177 (1968) · Zbl 0157.33604
[7] Greibach, S., A note on undecidable properties of formal languages, Mathematical Systems Theory, Vol. 2, 1-6 (1968) · Zbl 0157.01902
[9] Nivat, M., (Transductions des Languages de Chomsky (1967), Grenoble University), Unpublished Doctoral dissertation
[10] Yntema, M. K., Inclusion relations among families of context-free languages, Inform. Control, 10, 572-597 (1967) · Zbl 0207.31405
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.