DocumentCode :
3263349
Title :
Abstract families of languages
Author :
Ginsburg, Seymour ; Greibach, Sheila
fYear :
1967
fDate :
18-20 Oct. 1967
Firstpage :
128
Lastpage :
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.
Keywords :
Formal languages; Sufficient conditions; Transducers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Switching and Automata Theory, 1967. SWAT 1967. IEEE Conference Record of the Eighth Annual Symposium on
Conference_Location :
Austin, TX, USA
Type :
conf
DOI :
10.1109/FOCS.1967.3
Filename :
5397213
Link To Document :
بازگشت