Abstract
An AFL is a family of sets of words closed under six basic operations. It is shown that a certain family of homomorphic images of sets in an AFL is an AFL. Then two families of sets related to tape-bounded nondeterministic Turing acceptors are shown to coincide and be an AFL.
Similar content being viewed by others
References
S. Ginsburg andS. Greibach, Mappings which preserve context-sensitive languages,Information and Control 9 (1966), 563–582.
S. Ginsburg andS. Greibach, Abstract families of languages,Studies in Abstract Families of Languages, pp. 1–32, Memoirs Amer. Math. Soc., No. 87, Providence, 1969.
S. Ginsburg andE. H. Spanier, Control sets on grammars,Math. Systems Theory 2 (1968), 159–177.
J. E. Hopcroft andJ. D. Ullman, Nonerasing stack automata,J. Comput. System Sci. 1 (1967), 166–186.
M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.
Author information
Authors and Affiliations
Additional information
Research sponsored in part by the Air Force Cambridge Research Laboratories, Office of Aerospace Research, USAF, under contract F1962867C0008, the Air Force Office of Scientific Research, Office of Aerospace Research, USAF, under AFOSR Grant No. AF-AFOSR-1203-67A, and by the National Science Foundation, Grant No. GJ454.
Part of this work was also done at the System Development Corporation, Santa Monica, Calif.
Rights and permissions
About this article
Cite this article
Ginsburg, S., Hopcroft, J. Images of AFL under certain families of homomorphisms. Math. Systems Theory 5, 216–227 (1971). https://doi.org/10.1007/BF01694178
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01694178