Word equations and the exponent of periodicity
By: Volker Diekert, Silas Natterer, Alexander Thumm
Potential Business Impact:
Finds patterns in word puzzles with rules.
In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in the broader framework of word equations with regular constraints and establish new positive results: the conjecture holds for all quadratic word equations with constraints in finite semigroups from the variety $\mathbf{DLG}$ and its left-right dual $\mathbf{DRG}$, encompassing, in particular, all finite groups, commutative semigroups, and $\mathcal{J}$-trivial semigroups.
Similar Papers
Regular expressions over countable words
Logic in Computer Science
Makes computer rules work for endless lists.
An algebraic theory of ω-regular languages, via μν-expressions
Logic
Makes computer checks for infinite loops work.
Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
Formal Languages and Automata Theory
Lets computers describe and understand complex networks.