On the language of primitive words
From MaRDI portal
Recommendations
Cites work
- An “Interchange Lemma” for Context-Free Languages
- Analytic models and ambiguity of context-free languages
- Automata accepting primitive words
- Bounded Algol-Like Languages
- Calcul pratique des coefficients de Taylor d'une fonction algébrique
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3655943 (Why is no real title available?)
- scientific article; zbMATH DE number 3770980 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 3571510 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 522846 (Why is no real title available?)
- scientific article; zbMATH DE number 575907 (Why is no real title available?)
- scientific article; zbMATH DE number 1047927 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3363526 (Why is no real title available?)
- scientific article; zbMATH DE number 3403734 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Lexicographically least circular substrings
- On Context-Free Languages
- On uniformity within \(NC^ 1\)
- Optimal algorithms for computing the canonical form of a circular string
- Parity, circuits, and the polynomial-time hierarchy
- The equation \(a_ M=b^ Nc^ P\) in a free group
Cited in
(28)- Automata accepting primitive words
- Transcendence of formal power series with rational coefficients
- On the robustness of primitive words
- Squares and primitivity in partial words
- Counting bordered and primitive words with a fixed weight
- On unique factorizations of primitive words.
- On the language of primitive partial words
- Primitive words and roots of words
- Generalized periodicity and primitivity for words
- Primitive words are unavoidable for context-free languages
- scientific article; zbMATH DE number 522846 (Why is no real title available?)
- scientific article; zbMATH DE number 604881 (Why is no real title available?)
- scientific article; zbMATH DE number 1091111 (Why is no real title available?)
- scientific article; zbMATH DE number 1528638 (Why is no real title available?)
- Abelian primitive words
- Semiperiodic vectors and the context-freeness of \(Q_ n = Q\cap (ab^*)^n\)
- On non-primitive palindromic context-free languages
- Language of Lyndon partial words
- VISUALIZING LANGUAGES USING PRIMITIVE POWERS
- On the unavoidability of primitive words and other languages
- Scattered subword complexity of non-primitive words
- scientific article; zbMATH DE number 6792663 (Why is no real title available?)
- On Billaud words and their companions
- -reducible languages
- String rearrangement inequalities and a total order between primitive words
- On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems
- Properties of m-Bonacci words
- Simple linear time algorithm for sorting strings in omega-order with applications
This page was built for publication: On the language of primitive words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351946)
