A proof of the extended Duval's conjecture (Q557916): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2005.01.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015040013 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105697912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une caractérisation des mots périodiques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way string-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationship between the period of a finite word and the length of its unbordered segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity and unbordered segments of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMAL DUVAL EXTENSIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453475 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2005.01.008 / rank
 
Normal rank

Latest revision as of 21:28, 9 December 2024

scientific article
Language Label Description Also known as
English
A proof of the extended Duval's conjecture
scientific article

    Statements

    A proof of the extended Duval's conjecture (English)
    0 references
    0 references
    30 June 2005
    0 references
    A word \(u\) is said to be bordered iff there exists a nonempty word \(r\), \(r\neq u\), which is both prefix and suffix of \(u\). There is given a short and elementary proof of the following stronger version of Duval's conjecture. Let \(u\) be an unbordered word, and \(v\) a word of length \(|u|-1\), such that \(v\) is not a prefix of \(u\). Then \(uv\) contains an unbordered word of length at least \(|u|+1\).
    0 references
    Combinatorics on words
    0 references
    Duval's conjecture
    0 references
    unbordered words
    0 references

    Identifiers