The ring of k-regular sequences
Theoretical Computer Science
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Unrecognizable Sets of Numbers
Journal of the ACM (JACM)
A Remark on Acceptable Sets of Numbers
Journal of the ACM (JACM)
On the Recognition of Primes by Automata
Journal of the ACM (JACM)
Generalization of automatic sequences for numeration systems on a regular language
Theoretical Computer Science
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
The ring of k-regular sequences, II
Theoretical Computer Science - WORDS
On some questions regarding k -regular and k -context-free sequences
Theoretical Computer Science
On sets of numbers recognized by push-down automat
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
On complexity functions of infinite words associated with generalized Dyck languages
Theoretical Computer Science
| Hi-index | 5.23 |
We introduce a large family of k-context-free sequences for which we give a polynomial upper bound on their complexity functions.