Enumeration of irreducible binary words

DOI10.1016/0166-218X(88)90078-9zbMath0673.68046MaRDI QIDQ1121031

Yuji Kobayashi

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

density of languageirreducible binary words

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Formal languages and automata (68Q45)

Related Items (19)

Overlap-free words and spectra of matrices ⋮ On the context-freeness of the set of words containing overlaps ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ On the number of Abelian square-free words on four letters ⋮ A rewriting of Fife's theorem about overlap-free words ⋮ Comparing Complexity Functions of a Language and Its Extendable Part ⋮ Unnamed Item ⋮ Growth properties of power-free languages ⋮ On the number of partially abelian square-free words on a three-letter alphabet ⋮ Relations on words ⋮ Growth of repetition-free words -- a review ⋮ Pattern avoidance: themes and variations ⋮ Infinite words containing squares at every position ⋮ Growth rates of complexity of power-free languages ⋮ Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices ⋮ Overlap-free words and finite automata ⋮ Growth rates of power-free languages ⋮ Subword complexity and power avoidance ⋮ A characterization of overlap-free morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Repetition-free words
• Uniformly growing k-th power-free homomorphisms
• Unending chess, symbolic dynamics and a problem in semi-groups
• Binary Sequences which Contain no BBb

This page was built for publication: Enumeration of irreducible binary words