The Logical Approach to Automatic Sequences
From MaRDI portal
Publication:5093875
DOI10.1017/9781108775267OpenAlexW4297662269MaRDI QIDQ5093875
Publication date: 1 August 2022
Full work available at URL: https://doi.org/10.1017/9781108775267
Combinatorics on words (68R15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Automata sequences (11B85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (13)
Abelian combinatorics on words: a survey ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ Decidable problems in substitution shifts ⋮ String Attractors of Fixed Points of k-Bonacci-Like Morphisms ⋮ Dyck Words, Pattern Avoidance, and Automatic Sequences ⋮ Rudin-Shapiro Sums via Automata Theory and Logic ⋮ Automaticity and Parikh-Collinear Morphisms ⋮ Note on a Fibonacci parity sequence ⋮ Values of binary partition function represented by a sum of three squares ⋮ Transduction of automatic sequences and applications ⋮ Characterizations of families of morphisms and words via binomial complexities ⋮ A General Approach to Proving Properties of Fibonacci Representations via Automata Theory ⋮ Unnamed Item
Uses Software
This page was built for publication: The Logical Approach to Automatic Sequences
