• Publications
  • Influence
Canonical derivatives, partial derivatives and finite automaton constructions
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 GlushkovExpand
  • 93
  • 12
  • PDF
Characterization of Glushkov automata
  • P. Caron, D. Ziadi
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 28 February 2000
Abstract Glushkov's algorithm computes a nondeterministic finite automaton without e -transitions and with n+1 states from a regular expression having n occurrences of letters. The aim of this paperExpand
  • 98
  • 9
From Mirkin's Prebases to Antimirov's Word Partial Derivatives
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 ofExpand
  • 46
  • 8
From C-Continuations to New Quadratic Algorithms for Automaton Synthesis
Two classical non-deterministic automata recognize the language denoted by a regular expression: the position automaton which deduces from the position sets defined by Glushkov and McNaughton–Yamada,Expand
  • 31
  • 6
  • PDF
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton
We present a new sequential algorithm to convert a regular expression into its Glushkov automaton. This conversion runs in quadratic time, so it has the same time complexity as the Bruggemann-KleinExpand
  • 37
  • 3
Passage d'une expression rationnelle à un automate fini non-déterministe
Resume Le but de cet article est de presenter un nouvel algorithme sequentiel en temps Ω(n2) pour la conversion d’une expression rationnelle simple, ayant n occurrences de symboles, en son automateExpand
  • 40
  • 2
  • PDF
New Finite Automaton Constructions Based on Canonical Derivatives
Two classical constructions to convert a regular expression into a finite non-deterministic automaton provide complementary advantages: the notion of position of a symbol in an expression, introducedExpand
  • 20
  • 2
Normalized Expressions and Finite Automata
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, was first introduced by Mirkin from the notion of prebase and hasExpand
  • 17
  • 2
Computing the equation automaton of a regular expression in O(s2) space and time
Let E be a regular expression the size of which is s. Mirkin's prebases and Antimirov's partial derivatives lead to the construction of the same automaton, called the equation automaton of E. TheExpand
  • 16
  • 2
Fast equation automaton computation
The most efficient known construction of equation automaton is that due to Ziadi and Champarnaud. For a regular expression E, it requires O(|E|^2) time and space and is based on going from positionExpand
  • 9
  • 2
  • PDF