Relationship between the period of a finite word and the length of its unbordered segments
From MaRDI portal
Publication:1159466
DOI10.1016/0012-365X(82)90186-8zbMath0475.68038MaRDI QIDQ1159466
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Searching and sorting (68P10) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (22)
A Note on a Conjecture of Duval and Sturmian Words ⋮ A classical analogue of Yukawa coupling: Presymplectic formalism ⋮ Automatic Theorem-Proving in Combinatorics on Words ⋮ On Maximal Unbordered Factors ⋮ Linear computation of unbordered conjugate on unordered alphabet ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ Biinfinite words with maximal recurrent unbordered factors. ⋮ On the Relation between Periodicity and Unbordered Factors of Finite Words ⋮ The Ehrenfeucht-Silberger problem ⋮ Partial words and the critical factorization theorem revisited ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ MINIMAL DUVAL EXTENSIONS ⋮ Unbordered factors and Lyndon words ⋮ Border correlation of binary words ⋮ ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS ⋮ A proof of the extended Duval's conjecture ⋮ On the number of frames in binary words ⋮ Unnamed Item ⋮ Maximal unbordered factors of random strings ⋮ INVOLUTIVELY BORDERED WORDS ⋮ Unbordered partial words ⋮ Studies on finite Sturmian words
Cites Work
This page was built for publication: Relationship between the period of a finite word and the length of its unbordered segments