DocumentCode
2203750
Title
Characterization of context-free grammatical families
Author
Cremers, Armin ; Ginsburg, Seymour
fYear
1974
fDate
14-16 Oct. 1974
Firstpage
199
Lastpage
204
Abstract
Two characterization theorems for the class of context-free grammatical families are given. The characterizations are expressed in terms of the family of regular sets, the family of linear sets, and the following language-family operators: union, concatenation, the full semi-AFL operator, the full AFL operator, and a new ternary substitution operator.
Keywords
Character generation; Chromium; Computer science; Production; Reactive power;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1974., IEEE Conference Record of 15th Annual Symposium on
Conference_Location
USA
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1974.8
Filename
4569776
Link To Document