Boundedness of oriented walks generated by substitutions (Q679099)

From MaRDI portal
Revision as of 18:40, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Boundedness of oriented walks generated by substitutions
scientific article

    Statements

    Boundedness of oriented walks generated by substitutions (English)
    0 references
    1 September 1997
    0 references
    The authors address the question of boundedness for oriented one-dimensional walks generated by morphisms of the free monoid (substitutions). They completely solve the problem in the case of a morphism on two letters by showing there are four types of substitutions (depending on the transition matrices modulo 2), and by giving a necessary and sufficient condition of boundedness for each type.
    0 references
    automata sequences
    0 references
    substitutions
    0 references
    boundedness
    0 references
    oriented one-dimensional walks
    0 references
    transition matrices
    0 references
    0 references
    0 references

    Identifiers

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