2 search results - page 1 / 1 » Multidimensional generalized automatic sequences and shape-s... |
DM
2010
13 years 6 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...
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
Recognition of signs in sentences requires a training
set constructed out of signs found in continuous sentences.
Currently, this is done manually, which is a tedious process.
I...