Generalization of automatic sequences for numeration systems on a regular language
type: Item
instance of: scholarly article
title: Generalization of automatic sequences for numeration systems on a regular language
zbMATH Open document ID: 0945.68105
DOI: 10.1016/S0304-3975(00)00163-8
author: Michel Rigo
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1493490
zbMATH Keywords: automatic sequence
zbMATH Keywords: numeration system
zbMATH Keywords: regular language
zbMATH Keywords: complexity
zbMATH Keywords: substitution
MaRDI profile type: Publication
cites work: On the complexity of infinite sequences
cites work: Bertrand numeration systems and recognizability
cites work: Uniform tag sequences
cites work: Folds!
cites work: Confluent linear numeration systems
cites work: Q4880554
cites work: Greedy numeration systems and regularity
cites work: Numeration systems on a regular language
cites work: Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length)
cites work: Q4010752
cites work: Complexité des facteurs des mots infinis engendrés par morphismes itérés
cites work: A generalization of automatic sequences
cites work: Numeration systems, linear recurrences, and regular sets
description: scientific article; zbMATH DE number 1493490