Sequence avoiding any complete word

DOI10.1007/BF01158921MaRDI QIDQ1123274zbMATH OpenFDO

Authors S. H. Smith

Publication date 1988

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01158921

zbMATH Keywords

alphabetcomplete wordinstancessequence of wordssubwords

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Growth problems for avoidable words
• Words avoiding complementary subwords
• Binary words avoided by the Thue-Morse sequence
• Further applications of a power series method for pattern avoidance
• Avoiding patterns in the abelian sense

Cites work

• Avoidable patterns in strings of symbols
• scientific article; zbMATH DE number 3296252 (Why is no real title available?)

Cited in

(6)

• Binary words avoided by the Thue-Morse sequence
• On the avoidability index of palindromes
• On weakly self-avoiding words
• Words avoiding complementary subwords
• Weakly self-avoiding words and a construction of Friedman
• Absent Subsequences in Words

This page was built for publication: Sequence avoiding any complete word

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123274)