Article (Scientific journals)
Generalization of automatic sequences for numeration systems on a regular language
Rigo, Michel
2000In Theoretical Computer Science, 244, p. 271-281
Peer Reviewed verified by ORBi
 

Files


Full Text
GenAutomSeq.pdf
Author preprint (137.09 kB)
Request a copy

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
automatic sequences; numeration system; regular language; complexity; substitution; morphic word
Abstract :
[en] Let L be an infinite regular language on a totally ordered alphabet (Σ,<). 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, we study the first properties of these sequences and their relations with numeration systems.
Disciplines :
Mathematics
Computer science
Author, co-author :
Rigo, Michel  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Generalization of automatic sequences for numeration systems on a regular language
Publication date :
2000
Journal title :
Theoretical Computer Science
ISSN :
0304-3975
Publisher :
Elsevier Science, Amsterdam, Netherlands
Volume :
244
Pages :
271-281
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 01 July 2009

Statistics


Number of views
64 (8 by ULiège)
Number of downloads
3 (2 by ULiège)

Scopus citations®
 
23
Scopus citations®
without self-citations
12
OpenCitations
 
20

Bibliography


Similar publications



Contact ORBi