Algebraic tools for the concatenation product
Theoretical Computer Science
Star-Free Open Languages and Aperiodic Loops
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Constructing divisions into power groups
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
Faithful Loops for Aperiodic E-Ordered Monoids
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On a conjecture of schnoebelen
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Regular languages and partial commutations
Information and Computation
Hi-index | 0.00 |