Regular solutions of language inequalities and well quasi-orders
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
When Does Partial Commutative Closure Preserve Regularity?
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Regular languages and partial commutations
Information and Computation
Hi-index | 5.23 |