Subset construction complexity for homogeneous automata, position automata and ZPC-structures
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
Derivation of Rational Expressions with Multiplicity
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Brzozowski's Derivatives Extended to Multiplicities
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
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
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
Derivatives of rational expressions and related theorems
Theoretical Computer Science - Implementation and application automata
A simple way to construct NFA with fewer states and transitions
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
From Mirkin's Prebases to Antimirov's Word Partial Derivatives
Fundamenta Informaticae
Fast equation automaton computation
Journal of Discrete Algorithms
Antimirov and Mosses's Rewrite System Revisited
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Construction of Tree Automata from Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
Hedge Pattern Partial Derivative
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Efficient transformations from regular expressions to finite automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Star normal form, rational expressions, and glushkov WFAs properties
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Testing extended regular language membership incrementally by rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
From regular weighted expressions to finite automata
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
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
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the average number of states of partial derivative automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Regular expression containment: coinductive axiomatization and computational interpretation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial derivative automata formalized in Coq
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Partially ordered two-way büchi automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
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
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
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
Linear systems for regular hedge languages
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
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
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Approximate regular expressions and their derivatives
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
From Glushkov WFAs to \mathbb{K}-Expressions
Fundamenta Informaticae
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
Regular expression sub-matching using partial derivatives
Proceedings of the 14th symposium on Principles and practice of declarative programming
From Mirkin's Prebases to Antimirov's Word Partial Derivatives
Fundamenta Informaticae
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Verified decision procedures for MSO on words based on derivatives of regular expressions
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
FASER Formal and Automatic Security Enforcement by Rewriting by BPA algebra with test
International Journal of Grid and Utility Computing
Kleene algebra with tests and coq tools for while programs
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Verification and enforcement of access control policies
Formal Methods in System Design
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions
Journal of Automated Reasoning
A Goal-Directed Decision Procedure for Hybrid PDL
Journal of Automated Reasoning
| Hi-index | 5.23 |