DocumentCode
2200686
Title
Parallel leveled grammars
Author
Nash, B.O. ; Cohen, Rina S.
fYear
1969
fDate
15-17 Oct. 1969
Firstpage
263
Lastpage
276
Abstract
A new type of grammar, called a parallel leveled grammar, is introduced. The families of languages generated by such grammars with contextfree, linear or right-linear subrules are studied. Right-linear parallel finite-leveled languages can be displayed as nested vector expressions, which are extensions of regular expressions. Various hierarchy theorems for these families of languages are obtained. A normal form for context-free parallel leveled grammars is derived and connections of these with other families of languages are investigated.
Keywords
Computer science; Councils; Scattering; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1969., IEEE Conference Record of 10th Annual Symposium on
Conference_Location
Waterloo, ON, Canada
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1969.16
Filename
4569622
Link To Document