Pattern spectra, substring enumeration, and automatic sequences

DOI10.1016/0304-3975(92)90032-BzbMath0753.11012MaRDI QIDQ1190468

Patrick Morton, Jeffrey O. Shallit, Jean-Paul Allouche

Publication date: 26 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

automataautomatic sequencespattern spectrumbinary expansionpattern sequenceformal regular languagessequences given by special infinite productssubsequence of Prouhet-Thue-Morse sequencesubstring enumeration

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (3)

A pattern sequence approach to Stern's sequence ⋮ Unnamed Item ⋮ The ring of \(k\)-regular sequences

Cites Work

• Unnamed Item
• Unnamed Item
• A summation formula related to the binary digits
• Finite automata in number theory
• Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels)
• Paper Folding, Digit Patterns and Groups of Arithmetic Fractals
• Suites algébriques, automates et substitutions
• Binary Digit Distribution over Naturally Defined Sequences
• On the Number of Binary Digits in a Multiple of Three
• Uniform tag sequences

This page was built for publication: Pattern spectra, substring enumeration, and automatic sequences