On total regulators generated by derivation relations (Q1084874): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3873564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extendibility of unavoidable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regularity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On free monoids partially ordered by embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative one-counter languages are regular / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective constructions in well-partially-ordered free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite square-free co-CFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on off-line machines with 'Brownian' input heads / rank
 
Normal rank

Latest revision as of 17:45, 17 June 2024

scientific article
Language Label Description Also known as
English
On total regulators generated by derivation relations
scientific article

    Statements

    On total regulators generated by derivation relations (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    A derivation relation is a total regulator on \(\Sigma^*\) if, for every language \(L\subseteq \Sigma^*\), the set of all words derivable from L is a regular language. We show that for a wide class of derivation relations \(\Rightarrow^*_ P\), \(\Rightarrow^*_ P\) is a total regulator on \(\Sigma^*\) if and only if it is a well-quasi-order (wqo) on \(\Sigma^*\). Using wqo theory, we give a characterization of all non- erasing pure context-free (0S) derivation relations which are total regulators.
    0 references
    0 references
    context-free languages
    0 references
    unavoidable sets
    0 references
    regular language
    0 references
    well-quasi- order
    0 references
    0 references