On the size of the subword complexity of square-free DOL languages.
Hypergraph systems and their extensions
A pumping theorem for deterministic ETOL languages
On the separating power of EOL systems
On some context free languages that are not deterministic ETOL languages
FPOL systems generating counting languages
On subword complexities of homomorphic images of languages
Each regular code is included in a maximal regular code
Strong iterative pairs and the regularity of context-free languages
Permutable transformation semigroups.
On DOS languages and DOS mappings.
Pure interpretations of EOL forms
On the structure of recognizable languages of dependence graphs
Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma
Coordinated pair systems ; part I : Dyck works and classical pumping
Combinatorial properties of texts
Page 1