Automated development of software for program analysis and transformation
ACM SIGSOFT Software Engineering Notes
Higher-Order and Symbolic Computation
Universal Regular Path Queries
Higher-Order and Symbolic Computation
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
A New Recognition Algorithm for Extended Regular Expressions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
Higher-Order and Symbolic Computation
Fast equation automaton computation
Journal of Discrete Algorithms
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
An efficient computation of the equation K-automaton of a regular K-expression
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Note: From regular expressions to smaller NFAs
Theoretical Computer Science
The average transition complexity of Glushkov and partial derivative automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Computing the follow automaton of an expression
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Derivatives of regular expressions and an application
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Deterministic regular expressions in linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
| Hi-index | 5.23 |