From Mirkin's Prebases to Antimirov's Word Partial Derivatives

Authors:
Jean-Marc Champarnaud;Djelloul Ziadi
Affiliations:
-;-
Venue:
Fundamenta Informaticae
Year:
2001

Citing 4
Cited 2

Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Regular languages

Handbook of formal languages, vol. 1
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Deciding regular expressions (in-)equivalence in coq

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
On the average size of glushkov and equation automata for KAT expressions

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.