scientific article; zbMATH DE number 3932412
From MaRDI portal
Publication:3704906
Recommendations
Cited in
(27)- On the product of square-free words
- Repetition-free words
- Multidimensional unrepetitive configurations
- Iterated GSMs and CO-CFL
- Avoidable patterns on two letters
- Overlap-free words and finite automata
- Disposability in square-free words
- Counting ternary square-free words quickly
- Characterization of some binary words with few squares
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- More on Square-free Words Obtained from Prefixes by Permutations
- On prefix/suffix-square free words
- Efficient lower bounds on the number of repetition-free words
- scientific article; zbMATH DE number 3972211 (Why is no real title available?)
- scientific article; zbMATH DE number 3976386 (Why is no real title available?)
- scientific article; zbMATH DE number 3977002 (Why is no real title available?)
- A linear-time algorithm to decide whether a binary word contains an overlap
- Langford strings are square-free
- Algèbres effectives dans la programmation logique avec contraintes
- On the power of periodic iteration of morphisms
- Generating square-free words efficiently
- Abelian squares are avoidable on 4 letters
- Partially abelian squarefree words
- Physical oceanography, a mathematical introduction with MATLAB, by Reza Malek-Madani
- A powerful abelian square-free substitution over 4 letters
- On the context-freeness of the set of words containing overlaps
- Non-repetitive words relative to a rewriting system
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3704906)
