A note on morphic characterization of languages (Q1171887): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Purely Homomorphic Characterization of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homomorphic characterization of regular languages / 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: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948608 / rank
 
Normal rank

Revision as of 17:30, 13 June 2024

scientific article
Language Label Description Also known as
English
A note on morphic characterization of languages
scientific article

    Statements

    A note on morphic characterization of languages (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    homomorphic characterization
    0 references
    regular language
    0 references
    Dyck language
    0 references
    twin- shuffle language
    0 references
    recursively enumerable languages
    0 references
    rational transductions
    0 references
    context-free language
    0 references