On inherently ambiguous E0L languages (Q796996): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Grzegorz Rozenberg / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Gabriel V. Orman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Q3899529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ambiguity in EOL systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronized EOL forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambiguity in the developmental systems of Lindenmayer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank

Latest revision as of 12:35, 14 June 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
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers