An inverse homomorphic characterization of full principal AFL (Q1058861): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On some families of languages related to developmental systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4089754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank

Revision as of 16:50, 14 June 2024

scientific article
Language Label Description Also known as
English
An inverse homomorphic characterization of full principal AFL
scientific article

    Statements

    An inverse homomorphic characterization of full principal AFL (English)
    0 references
    0 references
    0 references
    1984
    0 references
    In spite of the quite laborious proof, the main result of this paper acquires a concise and elegant form: Let \({\mathcal L}\) be a full principal AFL closed under context-free substitution. Then there is a fixed language \(L_ 0\) in \({\mathcal L}\) such that for each L in \({\mathcal L}\) there exist a weak coding h and a homomorphism g such that \(L=hg^{-1}(L_ 0).\) An immediate corollary shows that there is a fixed ETOL language \(L_ 0\) such that for each ETOL language L there exist h and g as above such that \(L=hg^{-1}(L_ 0)\).
    0 references
    full principal AFL
    0 references
    ETOL language
    0 references
    0 references

    Identifiers