Canonical derivatives, partial derivatives and finite automaton constructions

@article{Champarnaud2002CanonicalDP,
  title={Canonical derivatives, partial derivatives and finite automaton constructions},
  author={Jean-Marc Champarnaud and Djelloul Ziadi},
  journal={Theor. Comput. Sci.},
  year={2002},
  volume={289},
  pages={137-163}
}
Let E be a regular expression. Our aim is to establish a theoretical relation between two well-known automata recognizing the language of E, namely the position automaton PE constructed by Glushkov or McNaughton and Yamada, and the equation automaton EE constructed by Mirkin or Antimirov. We define the notion of c-derivative (for canonical derivative) of a regular expression E and show that if E is linear then two Brzozowski’s derivatives of E are aci-similar if and only if the corresponding c… CONTINUE READING
BETA

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 64 CITATIONS

Position Automata for Semi-extended Expressions

  • Journal of Automata, Languages and Combinatorics
  • 2018
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Tree pattern matching from regular tree expressions

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Developments in Language Theory

  • Lecture Notes in Computer Science
  • 2017
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Des Codes barres pour les langages rationnels

VIEW 43 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Language operations with regular expressions of polynomial size

  • Theor. Comput. Sci.
  • 2008
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2001
2018

CITATION STATISTICS

  • 22 Highly Influenced Citations

  • Averaged 4 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

From Regular Expressions to Deterministic Automata

  • Theor. Comput. Sci.
  • 1986
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Derivatives of Regular Expressions

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

An algorithm for constructing a base in a language of regular expressions

B. G. Mirkin
  • Engineering Cybernetics, 5:110–116
  • 1966
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Regular languages

S. Yu
  • G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, Words, Languages, Grammars, pages 41–110. Springer-Verlag, Berlin
  • 1997
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…