On total regulators generated by derivation relations
Theoretical Computer Science
An algorithm to decide whether a rational subset of Nk is recognizable
Theoretical Computer Science
A note on the commutative closure of star-free languages
Information Processing Letters
Polynomial closure of group languages and open sets of the Hall topology
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Partial commutation and traces
Handbook of formal languages, vol. 3
Finiteness and Regularity in Semigroups and Formal Languages
Finiteness and Regularity in Semigroups and Formal Languages
The Book of Traces
Varieties Of Formal Languages
The "Last" Decision Problem for Rational Trace Languages
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Permutation Rewriting and Algorithmic Verification
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Shuffle on positive varieties of languages
Theoretical Computer Science
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
Permutation rewriting and algorithmic verification
Information and Computation
Star-free Star and Trace Languages
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
On a conjecture of schnoebelen
DLT'03 Proceedings of the 7th international conference on Developments in language theory
A star operation for star-free trace languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A Robust Class of Regular Languages
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Inferring regular trace languages from positive and negative samples
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Enhancing approximations for regular reachability analysis
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Regular languages and partial commutations
Information and Computation
| Hi-index | 0.00 |
The closure of a regular language under commutation or partial commutation has been extensively studied [1,11,12,13], notably in connection with regular model checking [2,3,7] or in the study of Mazurkiewicz traces, one of the models of parallelism [14,15,16,22]. We refer the reader to the survey [10,9] or to the recent articles of Ochmański [17,18,19] for further references.