A note on partially ordered tree automata
Information Processing Letters
When Does Partial Commutative Closure Preserve Regularity?
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A star operation for star-free trace languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Analysing message sequence graph specifications
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Local testing of message sequence charts is difficult
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Regular languages and partial commutations
Information and Computation
| Hi-index | 0.89 |