On the Shyr-Yu theorem

DOI10.1016/j.tcs.2009.06.039zbMath1194.68180OpenAlexW1993256108MaRDI QIDQ1034608

Laurent Vuillon, Géza Horváth, Pál Dömösi

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.039

zbMATH Keywords

combinatorics of words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

On primitive words with non-primitive product ⋮ Non-primitive words of the formpq^m ⋮ Some properties of the disjunctive languages contained in \(Q\)

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Alternative proof of the Lyndon-Schützenberger theorem
• Complexity of generalized Rudin-Shapiro sequences
• Uniqueness Theorems for Periodic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Shyr-Yu theorem