A characterization of free pairs of upper triangular free monoid morphisms (Q2417854): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of semigroup freeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifications of homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks concerning the freeness problem over morphism and matrix semigroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invertible Substitutions with a Common Periodic Point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3930656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948609 / rank
 
Normal rank

Revision as of 09:52, 19 July 2024

scientific article
Language Label Description Also known as
English
A characterization of free pairs of upper triangular free monoid morphisms
scientific article

    Statements

    A characterization of free pairs of upper triangular free monoid morphisms (English)
    0 references
    0 references
    29 May 2019
    0 references
    free monoid morphism
    0 references
    code
    0 references
    freeness problem
    0 references
    decidability
    0 references
    combinatorics on morphisms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references