Name
Abstract | ||
|---|---|---|
An E0L system G is called ambiguous if its language contains a word with (at least) two different derivations in G . An E0L language is called inherently E0L- ambiguous if every E0L system generating it is ambiguous. It is demonstrated that there exist inherently ambiguous E0L languages and in particular that the language { a m b 2 n : 1 ⩽ m ⩽ n } ∪ { a m 2 b 2 n : 1 ⩽ m ⩽ n } is inherently E0L-ambiguous. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1016/0304-3975(83)90071-3 | THEORETICAL COMPUTER SCIENCE |
DocType | Volume | Issue |
Journal | 28 | 1-2 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| G. Rozenberg | 2 | 298 | 64.16 |
| R. Verraedt | 3 | 82 | 20.98 |