Binary patterns in infinite binary words

DOI10.1007/3-540-45711-9_8MaRDI QIDQ4738292zbMATH OpenFDO

Authors Sergio Salemi, Antonio Restivo

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2300/23000107.htm

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Words and patterns
• Sequence entropy and the maximal pattern complexity of infinite words
• On maximal pattern complexity of some automatic words
• Abelian maximal pattern complexity of words
• Binary patterns in the Prouhet-Thue-Morse sequence

Cited in

(16)

• Binary words with a given Diophantine exponent
• Arithmetical complexity of symmetric D0L words.
• Patterns in words and languages
• Intertwined infinite binary words
• The subword complexity of a class of infinite binary words
• On the arithmetical complexity of Sturmian words
• Language structure of pattern Sturmian words
• Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps
• On possible growths of arithmetical complexity
• Sequences of low arithmetical complexity
• BINARY PATTERNS IN BINARY WORDS
• Words and patterns
• Sequence entropy and the maximal pattern complexity of infinite words
• Binary patterns in the Prouhet-Thue-Morse sequence
• Sequences of linear arithmetical complexity
• Binary words containing infinitely many overlaps

This page was built for publication: Binary patterns in infinite binary words

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