加载中…
2011-03-06
A variant of Hofstadter's sequence and finite automata
J. -P. AlloucheJ. Shallit
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本