arXiv · 1412.5041
Periodicity of Rauzy Scheme for substitution words
Abstract
From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes. This fact has consequence in discrete dynamic systems and logic. This fact is also generalization of fact that quadratic irrationals have periodic chain fractions.
Explore related subjects
Keep this discovery
Alexei Kanel-Belov, Ivan Mitrofanov. 2014-12-16. Periodicity of Rauzy Scheme for substitution words. https://arxiv.org/abs/1412.5041
Cite the original work for its findings. Save a collection to share your selection of sources.