Some uniformly erasable families of languages. (English) Zbl 0343.68033


68Q45 Formal languages and automata
Full Text: DOI


[1] Ginsburg, S., The Mathematical Theory of Context-Free Languages (1966), McGraw-Hill: McGraw-Hill New York · Zbl 0184.28401
[2] Ginsburg, S.; Goldstine, J.; Greibach, S., Uniformly erasable AFL, J. Comput. System Sci., 10, 165-182 (1975) · Zbl 0325.68042
[3] Ginsburg, S.; Greibach, S., Abstract families of languages, (Studies in Abstract Families of Languages. Studies in Abstract Families of Languages, American Mathematical Society Memoir, 87 (1969), Am. Math. Soc.,: Am. Math. Soc., Providence, R.I), 1-32 · Zbl 0308.68058
[4] Ginsburg, S.; Greibach, S., Principal AFL, J. Comput. System. Sci., 4, 308-338 (1970) · Zbl 0198.03102
[5] Ginsburg, S.; Rose, G., A characterization of machine mappings, Can. J. Math., 18, 381-388 (1966) · Zbl 0143.01903
[6] Ginsburg, S.; Spanier, E., Finite-turn pushdown automata, SIAM J. Control, 4, 429-453 (1966) · Zbl 0147.25302
[7] Goldstine, J., Abstract families of languages generated by bounded languages, (Ph.D. Thesis (1970), University of California)
[8] Greibach, S., An infinite hierarchy of context-free languages, J. ACM, 16, 91-106 (1969) · Zbl 0182.02002
[10] Myhill, J., Finite automata and the representation of events, Wright Air Development Command Tech. Note 57-624, 112-137 (1957)
[11] Ullian, J., Three theorems concerning principal AFL’s, J. Comput. System Sci., 5, 304-314 (1971) · Zbl 0217.22701
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.