The extended equation of Lyndon and Schützenberger

详细信息    查看全文

• 作者：Florin Manea^a ; ^{flm@informatik.uni-kiel.de} ; Mike M&uuml ; ller^a ; ^{mimu@informatik.uni-kiel.de} ; Dirk Nowotka^a ; ^{dn@informatik.uni-kiel.de} ; Shinnosuke Seki^b ; ^{s.seki@uec.ac.jp}
• 关键词：Combinatorics on words ; Word equations ; Lyndon&ndash ; Sch&uuml ; tzenberger equation ; Pseudoperiodicity
• 刊名：Journal of Computer and System Sciences
• 出版年：2017
• 出版时间：May 2017
• 年：2017
• 卷：85
• 期：Complete
• 页码：132-167
• 全文大小：1270 K
• 卷排序：85

文摘

The extension of the Lyndon–Schützenberger equation to pseudo-periodic words is considered. Solutions' pseudo-periodicity completely characterised. Proofs based on novel combinatorial insights in the structure of pseudo-repetitions.