The Community for Technology Leaders
8th Annual Symposium on Switching and Automata Theory (SWAT 1967) (1967)
Texas
Oct. 18, 1967 to Oct. 20, 1967
pp: 128-139
ABSTRACT
The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced. Operations preserving AFL are then considered. The concept of an abstract family of acceptors (AFA) is also introduced and shown to give rise to an AFL. A necessary and sufficient condition on an AFL is presented in order that the AFL come from some AFA. Finally, abstract families of transducers (AFA with output) are discussed.
INDEX TERMS
CITATION

S. Ginsburg and S. Greibach, "Abstract families of languages," 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)(FOCS), Texas, 1967, pp. 128-139.
doi:10.1109/FOCS.1967.3
79 ms
(Ver 3.3 (11022016))