Block-Deterministic Regular Languages
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Obtaining shorter regular expressions from finite-state automata
Theoretical Computer Science
Prefix-free regular languages and pattern matching
Theoretical Computer Science
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Generalizations of 1-deterministic regular languages
Information and Computation
Simple-regular expressions and languages
Journal of Automata, Languages and Combinatorics
Algorithms for learning regular expressions from positive data
Information and Computation
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Deciding determinism of caterpillar expressions
Theoretical Computer Science
Prefix-Free regular-expression matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
The generalization of generalized automata: expression automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Outfix-free regular languages and prime outfix-free decomposition
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 5.23 |