Context-Free Sequences - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Context-Free Sequences

Résumé

A sequence w over a finite alphabet A is generated by a uniform automaton if there exists an automaton labelled on {0,. .. , k−1} for some k > 1 and recognizing for each output a in A the set of positions of a in w expressed in base k. Automatic sequences are generated by finite automata. By considering pushdown automata instead of finite ones, we generate exactly the context-free sequences. We distinguish the sub-families of unambiguous, deterministic, real-time deterministic context-free sequences associated with the corresponding families of pushdown automata. We study the closure under shift, product, morphisms, inverse substitutions and various extractions of these four families of context-free sequences. Additionally, we show that only using multiplicatively dependent bases yields the same set of context-free sequences.

Mots clés

Fichier principal
Vignette du fichier
papier59-CaucalLeGonidec.pdf (226.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01450071 , version 1 (31-01-2017)

Identifiants

Citer

Didier Caucal, Marion Le Gonidec. Context-Free Sequences. Theoretical Aspects of Computing – ICTAC 2014, Gabriel Ciobanu, Dominique Méry Sep 2014, Bucharest, Romania. pp.259 - 276, ⟨10.1007/978-3-319-10882-7_16⟩. ⟨hal-01450071⟩
239 Consultations
108 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More