Periodicity of Rauzy Scheme for substitution words

preprint2014arXivOpen access

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 this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.