Numeration-automatic sequences

Simple item page
dc.creatorLaros, J. F. J.
dc.date2006-05-17
dc.date.accessioned2026-07-07T07:09:32Z
dc.date.available2026-07-07T07:09:32Z
dc.descriptionWe present a base class of automata that induce a numeration system and we give an algorithm to give the n-th word in the language of the automaton when the expansion of n in the induced numeration system is feeded to the automaton. Furthermore we give some algorithms for reverse reading of this expansion and a way to combine automata to other automata having the same properties.
dc.description25 pages, 22 figures
dc.identifierhttps://arxiv.org/abs/cs/0605076
dc.identifierhttp://arxiv.org/abs/cs/0605076
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111100
dc.subjectComputation and Language
dc.subjectDiscrete Mathematics
dc.titleNumeration-automatic sequences
dc.typetext

Files

Collections

arXiv