On a class of infinite words with bounded repetitions
Descriptional complexity measures of context-free languages
Generalizations of Parikh mappings
Parikh matrices have become a useful tool for investigation of subword structure of words. Several generalizations of this concept have been considered. Based on the concept of formal power series, we describe a general framework covering most of these generalizations. In addition, we provide a new characterization of binary amiable words – words having a common Parikh matrix.
Lyndon factorization of generalized words of Thue.
Page 1