Fair derivations in E0L systems (Q1062767): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A proof rule for fair termination of guarded commands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of some families of languages associated with biological systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of developmental languages using recurrence systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair derivations in context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equal matrix languages / rank
 
Normal rank

Latest revision as of 17:48, 14 June 2024

scientific article
Language Label Description Also known as
English
Fair derivations in E0L systems
scientific article

    Statements

    Fair derivations in E0L systems (English)
    0 references
    0 references
    0 references
    1985
    0 references
    This paper deals with the concept of fairness with respect to E0L systems. Fairness of derivations in synchronized E0L systems (SE0L) is defined by generalizing the notion of fairness in context-free derivations. It is proved that all SE0L systems are fairly terminating. As a corollary it is shown that all context-free languages can be fairly generated. It is also shown that the union, catenation and \(+\)-closure of SE0L systems are also fairly terminating.
    0 references
    termination
    0 references
    fairness
    0 references
    context-free languages
    0 references

    Identifiers