105
click to vote
STACS
15 years 6 months ago
1989 Springer 
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 ...
|
Theoretical Computer Science