Transduction of automatic sequences and applications
From MaRDI portal
Abstract: We consider the implementation of the transduction of automatic sequences, and their generalizations, in the Walnut software for solving decision problems in combinatorics on words. We provide a number of applications, including (a) representations of n! as a sum of three squares (b) overlap-free Dyck words and (c) sums of Fibonacci representations. We also prove results about iterated running sums of the Thue-Morse sequence.
Cites work
- Automatic Sequences
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- How Often is n! a Sum of Three Squares?
- scientific article; zbMATH DE number 3947643 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 914352 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- scientific article; zbMATH DE number 3076700 (Why is no real title available?)
- Iteration of maps by an automaton
- Local symmetries in the period-doubling sequence
- Logic and p-recognizable sets of integers
- On asymptotic density properties of the sequence \((n!)_{n=0}^\infty \)
- The Logical Approach to Automatic Sequences
- Uniform tag sequences
Cited in
(2)
This page was built for publication: Transduction of automatic sequences and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199882)
