Number of restrictions required for periodic word in the finite alphabet
Petr Lavrov
TL;DR
This paper investigates the minimum number of restrictions needed to uniquely identify periodic infinite words over finite alphabets, providing insights into the complexity of recognizing periodicity.
Contribution
It introduces a method to determine the number of restrictions necessary for identifying periodic words, extending the analysis to multiletter alphabets.
Findings
Derived bounds for restrictions in binary alphabets
Extended analysis to multiletter alphabets
Provided criteria for unique periodic word identification
Abstract
This work describes the number of restricted finite words in the alphabet A={a,b} required to identify an infinite word with some period n in the set of all infinite words in this alphabet given up to a shift. Also reviewed the case of multiletter alphabet.
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 · Coding theory and cryptography · DNA and Biological Computing