Process algebra
Some results on the generalized star-height problem
Information and Computation
Local languages and the Berry-Sethi algorithm
Theoretical Computer Science
Handbook of formal languages, vol. 1
Varieties Of Formal Languages
Algebraic tools for the concatenation product
Theoretical Computer Science
Sur les variétés de langages et de monoídes
Proceedings of the 4th GI-Conference on Theoretical Computer Science
Positive varieties of tree languages
Theoretical Computer Science
When Does Partial Commutative Closure Preserve Regularity?
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Robust Class of Regular Languages
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The expressive power of the shuffle product
Information and Computation
Regular languages and partial commutations
Information and Computation
Hi-index | 5.23 |
We show there is a unique maximal positive variety of languages which does not contain the language (ab)*. This variety is the unique maximal positive variety satisfying the two following conditions: it is strictly included in the class of rational languages and is closed under the shuffle operation. It is also the largest proper positive variety closed under length preserving morphisms. The ordered monoids of the corresponding variety of ordered monoids are characterized as follows: for every pair (a,b) of mutually inverse elements, and for every element z of the minimal ideal of the submonoid generated by a and b, (abzab)ω ≤ ab. In particular this variety is decidable.