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
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
Execution monitoring enforcement for limited-memory systems
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services
Language operations with regular expressions of polynomial size
Theoretical Computer Science
Efficient recognition of trace languages defined by repeat-until loops
Information and Computation
Note: From regular expressions to smaller NFAs
Theoretical Computer Science
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Strict local testability with consensus equals regularity
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Hi-index | 5.23 |