Results 11 to 20 of about 24,121 (290)
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F Blanchet-Sadri
exaly +3 more sources
Automaticity of primitive words and irreducible polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Automata, Logic and ...
Anne Lacroix, Narad Rampersad
doaj +6 more sources
On unique factorizations of primitive words
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tero Harju, Dirk Nowotka
exaly +4 more sources
On primitive words with non-primitive product [PDF]
RAIRO - Theoretical Informatics and Applications, 2022 Let𝒜be an alphabet of sizen≥ 2. Our goal in this paper is to give a complete description of primitive wordsp≠qover𝒜such thatpqis non-primitive. As an application, we will count the cardinality of the setℰ(l,𝒜) of all couples (p,q) of distinct primitive words such that |p| = |q| =landpqis non-primitive, wherelis a positive integer.
Othman Echi +2 more
openaire +3 more sources
International Journal of Foundations of Computer Science, 2011 We investigate Abelian primitive words, which are words that are not Abelian powers. We show the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive in linear time (for fixed alphabet size). Also differently from classical primitive words, we find that a word may have more than one Abelian root.
Michael Domaratzki, Narad Rampersad
openaire +6 more sources
On a Special Class of Primitive Words [PDF]
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elena Czeizler +2 more
openaire +3 more sources
A Classification of Trapezoidal Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word
Gabriele Fici
doaj +3 more sources
Morphically primitive words [PDF]
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Reidenbach, Johannes C. Schneider
openaire +2 more sources
PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS [PDF]
International Journal of Foundations of Computer Science, 2011 A pseudo-primitive word with respect to an antimorphic involution θ is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and θ(t). Properties of pseudo-primitive words are investigated in this paper. These properties link pseudo-primitive words with essential notions in combinatorics on words such as primitive ...
Lila Kari +2 more
openaire +3 more sources