Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
Handbook of formal languages, vol. 1
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
Brzozowski's Derivatives Extended to Multiplicities
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Derivatives of rational expressions and related theorems
Theoretical Computer Science - Implementation and application automata
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
On the average number of states of partial derivative automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
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
The average transition complexity of Glushkov and partial derivative automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
Hi-index | 0.00 |
Our aim is to give a proof of the fact that two notions related to regular expressions, the prebases due to Mirkin and the partial derivatives introduced by Antimirov lead to the construction of identical nondeterministic automata recognizing the language of a given regular expression.