A proof of the extended Duval's conjecture

DOI10.1016/J.TCS.2005.01.008zbMATH Open1127.68075OpenAlexW2015040013WikidataQ105697912 ScholiaQ105697912MaRDI QIDQ557916FDOQ557916

Authors: Štěpán Holub 

Publication date: 30 June 2005

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

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

Recommendations

• scientific article; zbMATH DE number 2051183
• scientific article; zbMATH DE number 2040916
• STACS 2004
• scientific article; zbMATH DE number 2051182
• MINIMAL DUVAL EXTENSIONS

zbMATH Keywords

unbordered wordsCombinatorics on wordsDuval's conjecture

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15)

Cites Work

• Two-way string-matching
• Title not available (Why is that?)
• Relationship between the period of a finite word and the length of its unbordered segments
• STACS 2004
• Periodicity and unbordered segments of words
• MINIMAL DUVAL EXTENSIONS
• Une caractérisation des mots périodiques
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

• MINIMAL DUVAL EXTENSIONS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the relation between periodicity and unbordered factors of finite words
• Unbordered factors and Lyndon words
• On the Relation between Periodicity and Unbordered Factors of Finite Words
• Title not available (Why is that?)
• Fully bordered words
• On the number of unbordered factors
• Automatic Theorem-Proving in Combinatorics on Words
• Title not available (Why is that?)
• Automatic theorem-proving in combinatorics on words
• The Ehrenfeucht-Silberger problem
• STACS 2004

This page was built for publication: A proof of the extended Duval's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557916)