Dyck words, pattern avoidance, and automatic sequences

DOI10.46298/CM.12695MaRDI QIDQ6615627

Jeffrey Shallit, Narad Rampersad, L. A. S. Mól

Publication date: 8 October 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

Fibonacci sequenceThue-Morse sequenceautomatic sequencespattern avoidancebinary wordscombinatorics on wordsperiod-doubling sequenceRudin-Shapiro sequenceDyck wordsWalnut theorem prover

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• First-order logics: some characterizations and closure properties
• On k-repetition freeness of length uniform morphisms over a binary alphabet
• The ring of \(k\)-regular sequences
• Über Summen von Rudin-Shapiroschen Koeffizienten
• Synchronized sequences
• Extremal overlap-free and extremal \(\beta\)-free binary words
• A generator of morphisms for infinite words
• The Logical Approach to Automatic Sequences
• Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
• Dyck Words, Pattern Avoidance, and Automatic Sequences
• Rudin-Shapiro Sums via Automata Theory and Logic
• Transduction of automatic sequences and applications

This page was built for publication: Dyck words, pattern avoidance, and automatic sequences

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