A variant of Hofstadter's sequence and finite automata
Number Theory
2011-06-14 v2 Discrete Mathematics
Formal Languages and Automata Theory
Abstract
Following up on a paper of Balamohan, Kuznetsov, and Tanny, we analyze a variant of Hofstadter's Q-sequence and show it is 2-automatic. An automaton computing the sequence is explicitly given.
Keywords
Cite
@article{arxiv.1103.1133,
title = {A variant of Hofstadter's sequence and finite automata},
author = {J. -P. Allouche and J. Shallit},
journal= {arXiv preprint arXiv:1103.1133},
year = {2011}
}