Numeration systems on a regular language

Simple item page
dc.creatorLecomte, Pierre B. A.
dc.creatorRigo, Michel
dc.date1999-03-04
dc.date.accessioned2026-07-07T03:24:01Z
dc.date.available2026-07-07T03:24:01Z
dc.descriptionGeneralizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable. We also study the translation and the multiplication by constants as well as the order dependence of the recognizability.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/cs/9903005
dc.identifierhttp://arxiv.org/abs/cs/9903005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33165
dc.subjectOther Computer Science
dc.subjectF.1.1;F.4.3
dc.titleNumeration systems on a regular language
dc.typetext

Files

Collections

arXiv