Periodes et repetitions des mots du monoide libre
From MaRDI portal
Publication:1255785
DOI10.1016/0304-3975(79)90003-3zbMath0402.68052OpenAlexW2049115143MaRDI QIDQ1255785
Publication date: 1979
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(79)90003-3
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (22)
Density of Critical Factorizations ⋮ On abelian versions of critical factorization theorem ⋮ Critical factorisation in square-free words ⋮ Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups) ⋮ Unnamed Item ⋮ The Ehrenfeucht-Silberger problem ⋮ Partial words and the critical factorization theorem revisited ⋮ A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) ⋮ Unnamed Item ⋮ Linear-time computation of local periods ⋮ On unique factorizations of primitive words. ⋮ Partial words and the critical factorization theorem ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ Recurrence and periodicity in infinite words from local periods ⋮ Periods in extensions of words ⋮ Périodes locales et propagation de périodes dans un mot ⋮ Periodicity and the golden ratio ⋮ A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY ⋮ On periodicity of generalized two-dimensional infinite words ⋮ Sur la classification syntaxique ⋮ A multidimensional critical factorization theorem ⋮ Periodicity and roots of transfinite strings
Cites Work
This page was built for publication: Periodes et repetitions des mots du monoide libre
