Dyck Words, Pattern Avoidance, and Automatic Sequences

DOI10.1007/978-3-031-33180-0_17arXiv2301.06145OpenAlexW4381304074MaRDI QIDQ6134876

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

Publication date: 25 July 2023

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

Full work available at URL: https://arxiv.org/abs/2301.06145

zbMATH Keywords

pattern avoidanceDyck wordautomatic sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Dyck Words, Pattern Avoidance, and Automatic Sequences ⋮ Transduction of automatic sequences and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• First-order logics: some characterizations and closure properties
• On k-repetition freeness of length uniform morphisms over a binary alphabet
• Sequences with constant number of return words
• The ring of \(k\)-regular sequences
• Synchronized sequences
• The Logical Approach to Automatic Sequences
• Subword Complexity and k-Synchronization
• Dyck Words, Pattern Avoidance, and Automatic Sequences

This page was built for publication: Dyck Words, Pattern Avoidance, and Automatic Sequences