The extended equation of Lyndon and Schützenberger
From MaRDI portal
Publication:730507
DOI10.1016/j.jcss.2016.11.003zbMath1428.68226OpenAlexW2557908268MaRDI QIDQ730507
Dirk Nowotka, Shinnosuke Seki, Mike Müller, Florin Manea
Publication date: 28 December 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2016.11.003
Related Items
Hide and seek with repetitions, Equations enforcing repetitions under permutations, Pseudo-solutions of word equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- The equation \(a_ M=b^ Nc^ P\) in a free group
- On a special class of primitive words
- Alternative proof of the Lyndon-Schützenberger theorem
- On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup
- The equation \(x^i=y^jz^k\) in a free semigroup.
- UNARY PATTERNS WITH INVOLUTION
- Fine and Wilf’s Theorem and Pseudo-repetitions
- Generalised Lyndon-Schützenberger Equations
- Finding Pseudo-Repetitions
- On the Pseudoperiodic Extension of u^l = v^m w^n
- Testing Generalised Freeness of Words
- An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
- PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS
- The Avoidability of Cubes under Permutations
- A Minimal Periods Algorithm with Applications
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- Discovering Hidden Repetitions in Words
- Uniqueness Theorems for Periodic Functions
- Algorithms on Strings
- Watson-Crick Conjugate and Commutative Words
- On the Equation Z n 1 Z n 2 ⋯z n k = y n in a Free Semigroup
