×

Continuous operations on languages. (English) Zbl 0364.68068


MSC:

68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] S. Ginsburg,Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975. · Zbl 0325.68002
[2] S. Ginsburg andJ. Goldstine, Intersection-closed full AFL and the recursively enumerable languages,Inf. and Contr. 22 (1973), 201–231. · Zbl 0267.68035
[3] S. Ginsburg andE. Spanier, AFL with the semilinear property,J. Comput. Sys. Sci. 5 (1971), 365–396. · Zbl 0235.68029
[4] S. Ginsburg andE. Spanier, On incomparable abstract family of languages (AFL),J. Comput. Sys. Sci. 9 (1974), 88–108. · Zbl 0289.68038
[5] E. M. Gold, Language identification in the limit,Inf. and Contr. 10 (1967), 447–474. · Zbl 0259.68032
[6] J. Goldstine, Some independent families of one-letter languages,J. Comput. Sys. Sci. 10 (1975), 351–369. · Zbl 0305.68059
[7] S. Greibach, Chains of full AFL’s,Math. Sys. Th. 4 (1970), 231–242. · Zbl 0203.30102
[8] S. Greibach, Full AFLs and nested iterated substitution,Inf. and Contr. 16 (1970), 7–35. · Zbl 0188.03102
[9] J. Hocking andG. Young,Topology, Addison-Wesley, Reading, Mass., 1961.
[10] S. Itoga, A scheme for comparing language operations, doctoral dissertation, Univ. of Calif. at Los Angeles, 1973.
[11] J. Kelley,General Topology, Van Nostrand, Princeton, NJ, 1955.
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.