TY - JOUR

T1 - Periodicity of Rauzy Scheme for substitution words,

AU - Belov, A.

AU - Mitrofanov, I.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://arxiv.org/abs/1412.5041

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

JO - Cornell University Library

JF - Cornell University Library

ER -