Minimal number of restrictions defining a periodic word
Petr Lavrov
TL;DR
This paper provides a sketch of a proof estimating the minimum number of restrictions needed to define a periodic word over a finite alphabet, utilizing Rauzy graphs.
Contribution
It introduces a novel estimation method for the restrictions defining periodic words using Rauzy graphs, advancing theoretical understanding.
Findings
Estimated the minimal restrictions for periodic words
Utilized Rauzy graphs for the estimation
Provided a proof sketch for the bounds
Abstract
Sketch of the proof of estimation of number of restictions required for defining a periodic word in the finite alphabet. Uses the Rausy graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Geometric and Algebraic Topology · Algorithms and Data Compression