Continuous operations on languages
暂无分享,去创建一个
[1] Seymour Ginsburg,et al. Intersection-closed full AFL and the recursively enumerable languages , 1971, Inf. Control..
[2] Seymour Ginsburg,et al. AFL with the Semilinear Property , 1971, J. Comput. Syst. Sci..
[3] Seymour Ginsburg,et al. On Incomparable Abstract Family of Languages (AFL) , 1974, J. Comput. Syst. Sci..
[4] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[5] Seymour Ginsburg,et al. Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .
[6] Sheila A. Greibach,et al. Chains of full AFL's , 1970, Mathematical systems theory.
[7] Samuel Eilenberg,et al. Review of "Algebraic and automata-theoretic properties of formal languages" by Seymour Ginsburg. North Holland, 1975. , 1976, SIGA.
[8] Sheila A. Greibach,et al. Full AFLs and Nested Iterated Substitution , 1969, Inf. Control..
[9] Jonathan Goldstine,et al. Some Independent Families of One-Letter Languages , 1975, J. Comput. Syst. Sci..