On the language of primitive words

DOI10.1016/0304-3975(95)00098-4zbMath0872.68091OpenAlexW2028755743MaRDI QIDQ1351946

O. Diekmann

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00098-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

On the robustness of primitive words ⋮ String rearrangement inequalities and a total order between primitive words ⋮ Unnamed Item ⋮ ON NON-PRIMITIVE PALINDROMIC CONTEXT-FREE LANGUAGES ⋮ Counting bordered and primitive words with a fixed weight ⋮ On the Language of Primitive Partial Words ⋮ Transcendence of formal power series with rational coefficients ⋮ Squares and primitivity in partial words

Uses Software

• ALGOL 60

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Analytic models and ambiguity of context-free languages
• Automata accepting primitive words
• Lexicographically least circular substrings
• Optimal algorithms for computing the canonical form of a circular string
• Calcul pratique des coefficients de Taylor d'une fonction algébrique
• On uniformity within \(NC^ 1\)
• Parity, circuits, and the polynomial-time hierarchy
• An “Interchange Lemma” for Context-Free Languages
• Fast Pattern Matching in Strings
• Bounded Algol-Like Languages
• On Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the language of primitive words