Boundedness of oriented walks generated by substitutions (Q679099)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Boundedness of oriented walks generated by substitutions |
scientific article; zbMATH DE number 1002066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Boundedness of oriented walks generated by substitutions |
scientific article; zbMATH DE number 1002066 |
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.7923302054405212
0 references
0.6990318894386292
0 references
0.6951799392700195
0 references
