UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS

DOI10.1142/S0218196705002463zbMath1073.68066MaRDI QIDQ5703672

Jason P. Bell

Publication date: 8 November 2005

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

almost unavoidable sets

Mathematics Subject Classification ID

Combinatorics on words (68R15) Enumerative combinatorics (05A99)

Related Items (2)

Random subshifts of finite type ⋮ Unnamed Item

Cites Work

• A proof of Golomb's conjecture for the de Bruijn graph
• UNAVOIDABLE SETS OF CONSTANT LENGTH

This page was built for publication: UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS