6719 search results - page 1 / 1344 » A Generalization of Automatic Sequences |
STACS
1989
Springer
13 years 9 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 ...
DM
2010
13 years 5 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
CIKM
2009
Springer
14 years 10 days ago
2009
Springer
The popularity of Wikipedia and other online knowledge bases has recently produced an interest in the machine learning community for the problem of automatic linking. Automatic hy...
MM
2006
ACM
13 years 11 months ago
2006
ACM
Effective usage of multimedia digital libraries has to deal with the problem of building efficient content annotation and retrieval tools. MOM (Multimedia Ontology Manager) is a ...
IPCCC
2006
IEEE
13 years 11 months ago
2006
IEEE
We present an approach to the question of evaluating worm defenses against future, yet unseen and possibly defense-aware worm behavior. Our scheme employs model checking to produc...