Numeration-automatic sequences
计算与语言
2007-05-23 v1 离散数学
摘要
We 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.
引用
@article{arxiv.cs/0605076,
title = {Numeration-automatic sequences},
author = {J. F. J. Laros},
journal= {arXiv preprint arXiv:cs/0605076},
year = {2007}
}
备注
25 pages, 22 figures