On inherently ambiguous E0L languages (Q796996): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(83)90071-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1992565783 / rank | |||
Normal rank |
Revision as of 21:10, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On inherently ambiguous E0L languages |
scientific article |
Statements
On inherently ambiguous E0L languages (English)
0 references
1984
0 references
In this paper the interesting topic of ambiguity of E0L languages is considered. It is known that an E0L system is called ambiguous if its language contains a word with (at least) two different derivation trees in G. An E0L language is called inherently E0L-ambiguous if every E0L system that generates it is ambiguous. The authors demonstrate that there exist inherently ambiguous E0L languages. Particularly it is proved that the language \[ \{a^ mb^{2^ n}:1\leq m\leq n\}\cup \{a^{m^ 2}b^{2^ n}:1\leq m\leq n\} \] is an inherently ambiguous E0L language.
0 references
ambiguity
0 references
E0L languages
0 references
inherently ambiguous E0L language
0 references