LUSTRE: a declarative language for real-time programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the use of regular expressions for searching text
ACM Transactions on Programming Languages and Systems (TOPLAS)
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Theoretical Computer Science
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
An Algebraic Foundation for Adaptive Programming
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Fast Regular Expression Search
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Compact DFA Representation for Fast Regular Expression Search
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Glushkov Construction for Multiplicities
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Compiling Adaptive Programs by Partial Evaluation
CC '00 Proceedings of the 9th International Conference on Compiler Construction
Computing the Equation Automaton of a Regular Expression in Space and Time
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Block-Deterministic Regular Languages
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Regular Expression Searching over Ziv-Lempel Compressed Text
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
Regexpcount, a symbolic package for counting problems on regular expressions and words
Fundamenta Informaticae - Special issue on computing patterns in strings
Regular expression searching on compressed text
Journal of Discrete Algorithms
A simple way to construct NFA with fewer states and transitions
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Binary queries for document trees
Nordic Journal of Computing
Approximate regular expression searching with arbitrary integer weights
Nordic Journal of Computing
Compiling regular patterns to sequential machines
Proceedings of the 2005 ACM symposium on Applied computing
Boolean operations and inclusion test for attribute-element constraints
Theoretical Computer Science
EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version
Journal of Functional Programming
On preventing intrusions by process behavior monitoring
ID'99 Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1
Regular Expression Matching in Reconfigurable Hardware
Journal of Signal Processing Systems
Construction of Tree Automata from Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Adapting functional programs to higher order logic
Higher-Order and Symbolic Computation
Regular-expression derivatives re-examined
Journal of Functional Programming
Language operations with regular expressions of polynomial size
Theoretical Computer Science
Hedge Pattern Partial Derivative
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Regular Expression Matching on Graphics Hardware for Intrusion Detection
RAID '09 Proceedings of the 12th International Symposium on Recent Advances in Intrusion Detection
Boolean operations for attribute-element constraints
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Processing SPARQL queries with regular expressions in RDF databases
DTMBIO '10 Proceedings of the ACM fourth international workshop on Data and text mining in biomedical informatics
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Partial derivatives of an extended regular expression
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
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
Kleene theorems for product systems
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Clausal Tableaux for Hybrid PDL
Electronic Notes in Theoretical Computer Science (ENTCS)
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th 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
The validation of SGML content models
Mathematical and Computer Modelling: An International Journal
Test generation for interworking systems
Computer Communications
Regexpcount, a symbolic package for counting problems on regular expressions and words
Fundamenta Informaticae - Computing Patterns in Strings
Temporal antecedent failure: refining vacuity
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |