Name
Abstract | ||
|---|---|---|
The relationship between extended context free normal systems (a nondeterministic version of Tag systems of Post with deletion number equal to 1 and using nonterminals) and ETOL systems is considered. It is demonstrated that the class of languages generated by context free normal systems (denoted L(ECFN)) lies strictly between the clas of EOL languages (denoted L(EOL)) and the class of ETOL languages. Several characterizations of L(ECFN)) in terms of L(EOL)) are provided and a number of closure properties of L'(ECFN) are established. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0022-0000(83)90019-3 | Journal of Computer and System Sciences |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Nondeterministic algorithm,Mathematics | Journal | 26 |
Issue | ISSN | Citations |
1 | 0022-0000 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| Joost Engelfriet | 2 | 2783 | 212.93 |
| G. Rozenberg | 3 | 298 | 64.16 |