scientific article

zbMath0582.68042MaRDI QIDQ3704906

Jean Berstel

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

survey

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (14)

A powerful abelian square-free substitution over 4 letters ⋮ Counting ternary square-free words quickly ⋮ On the context-freeness of the set of words containing overlaps ⋮ Exponential lower bounds for the number of words of uniform length avoiding a pattern ⋮ Multidimensional unrepetitive configurations ⋮ Iterated GSMs and CO-CFL ⋮ Avoidable patterns on two letters ⋮ Algèbres effectives dans la programmation logique avec contraintes ⋮ Non-repetitive words relative to a rewriting system ⋮ A linear-time algorithm to decide whether a binary word contains an overlap ⋮ On the power of periodic iteration of morphisms ⋮ Partially abelian squarefree words ⋮ Abelian squares are avoidable on 4 letters ⋮ Overlap-free words and finite automata

This page was built for publication: