论文信息 - Parallel Leveled Grammars

Parallel Leveled Grammars

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.

B. o. Nash | Rina S. Cohen

[1] J. A. Brzozowski,et al. Regular-Like Expressions for Some Irregular Languages , 1968, SWAT.

[2] Arnold L. Rosenberg,et al. On n-tape finite state acceptors , 1964, SWCT.

[3] Arnold L. Rosenberg,et al. A Machine Realization of the Linear Context-Free Languages , 1967, Inf. Control..

[4] Daniel J. Rosenkrantz,et al. Programmed Grammars and Classes of Formal Languages , 1969, JACM.

[5] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[6] Seymour Ginsburg,et al. Derivation-Bounded Languages , 1968, SWAT.