Counting bordered and primitive words with a fixed weight
From MaRDI portal
Publication:2484439
Recommendations
- Counting bordered partial words by critical positions
- On the number of abelian bordered words
- scientific article; zbMATH DE number 2196238
- Combinatorics on partial word borders
- On counting of periodic words
- Upper bound for the number of closed and privileged words
- Counting minimal semi-Sturmian words
- On the number of abelian bordered words (with an example of automatic theorem-proving)
- Counting Ordered Patterns in Words Generated by Morphisms
- Counting ordered patterns in words generated by morphisms
Cites work
- A note on bifix-free sequences (Corresp.)
- Endliche 0-1-Folgen mit gleichen Teilblöcken.
- Enumeration of bordered words, le langage de la vache-qui-rit
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- On the language of primitive words
- The On-Line Encyclopedia of Integer Sequences
Cited in
(8)- Coding by minimal linear grammars
- Some operations preserving primitivity of words
- Avoiding cross-bifix-free binary words
- Involutively bordered words
- Counting Parameterized Border Arrays for a Binary Alphabet
- scientific article; zbMATH DE number 2196238 (Why is no real title available?)
- Smallest and Largest Block Palindrome Factorizations
- Faster algorithms for ranking/unranking bordered and unbordered words
This page was built for publication: Counting bordered and primitive words with a fixed weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484439)
