Boundedness of oriented walks generated by substitutions (Q679099): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.5802/jtnb.175 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016276868 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recurrent sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On transience and recurrence of generalized random walks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automatic walks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Iteration of maps by an automaton / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5749349 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Wire bending / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3801570 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Marches sur les arbres homogènes suivant une suite substitutive / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.5802/JTNB.175 / rank | |||
Normal rank | |||
Latest revision as of 00:38, 10 December 2024
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
