BINARY PATTERNS IN BINARY WORDS

DOI10.1142/S0218196791000262MaRDI QIDQ4024637zbMATH OpenOpenAlexFDO

Authors Tomas Vanicek, Pavel Goralčík

Publication date 8 February 1993

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

Full work available at URL https://doi.org/10.1142/s0218196791000262

zbMATH Keywords

avoidable binary patternsbissective codefree semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2087492
• scientific article; zbMATH DE number 716160
• Avoidable binary patterns in partial words
• Avoidable binary patterns in partial words
• Counting binary words avoiding alternating patterns
• Binary words excluding a pattern and proper Riordan arrays
• scientific article; zbMATH DE number 4132165
• Binary patterns in the Prouhet-Thue-Morse sequence
• Periods and binary words

Cited in

(9)

• Patterns in words and languages
• Binary words avoided by the Thue-Morse sequence
• Pattern 1ʲ⁰^i avoiding binary words
• Binary patterns in binary cube-free words: avoidability and growth
• Every binary pattern of length greater than 14 is abelian-2-avoidable
• Growth properties of power-free languages
• scientific article; zbMATH DE number 2087216 (Why is no real title available?)
• The simplest binary word with only three squares
• Binary words avoiding the pattern AABBCABBA

This page was built for publication: BINARY PATTERNS IN BINARY WORDS

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