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
On infinite transition graphs having a decidable monadic theory
Theoretical 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
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Enumerative combinatorics and algebraic languages
FCT '85 Fundamentals of Computation Theory
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Analytic Combinatorics
Representing real numbers in a generalized numeration system
Journal of Computer and System Sciences
On the complexity of a family of k-context-free sequences
Theoretical Computer Science
| Hi-index | 5.23 |
In this article, we construct a family of infinite words, generated by countable automata and also generated by substitutions over infinite alphabets, closely related to parenthesis languages and we study their complexity functions. We obtain a family of binary infinite words m^(^b^), indexed on the number b=1 of parenthesis types, such that the growth order of the complexity function of m^(^b^) is n(logn)^2 if b=1 and n^1^+^l^o^g^"^2^"^b^b if b=2.