Sciweavers

80
Voted
DM
2007
98views more  DM 2007»
14 years 8 months ago
p-adic valuations and k-regular sequences
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
Jason P. Bell
STACS
1989
Springer
15 years 28 days ago
A Generalization of Automatic Sequences
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
Jeffrey Shallit