Generalization of automatic sequences for numeration systems on a regular language
| dc.creator | Rigo, Michel | |
| dc.date | 1999-06-22 | |
| dc.date.accessioned | 2026-07-07T03:24:09Z | |
| dc.date.available | 2026-07-07T03:24:09Z | |
| dc.description | Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the output alphabet of the automaton. This process generalizes the concept of k-automatic sequence for abstract numeration systems on a regular language (instead of systems in base k). Here, I study the first properties of these sequences and their relations with numeration systems. | |
| dc.description | 10 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/cs/9906017 | |
| dc.identifier | http://arxiv.org/abs/cs/9906017 | |
| dc.identifier | Theoret. Comput. Sci. 244 (2000) 271--281 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33217 | |
| dc.subject | Computational Complexity | |
| dc.subject | F.1.1; F.1.3; F.4.3 | |
| dc.title | Generalization of automatic sequences for numeration systems on a regular language | |
| dc.type | text |