Alternative proof of the Lyndon-Schützenberger theorem

DOI10.1016/J.TCS.2006.08.023zbMath1154.68095OpenAlexW1978606168MaRDI QIDQ860888

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

Publication date: 9 January 2007

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

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

zbMATH Keywords

combinatorics of words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (4)

On primitive words with non-primitive product ⋮ Non-primitive words of the formpq^m ⋮ The extended equation of Lyndon and Schützenberger ⋮ On the Shyr-Yu theorem

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Multiple factorizations of words and defect effect
• The equation \(x^i=y^jz^k\) in a free semigroup.
• Automatic Sequences
• Uniqueness Theorems for Periodic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternative proof of the Lyndon-Schützenberger theorem