Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Canonical derivatives, partial derivatives and finite automaton constructions

- J. Champarnaud, D. Ziadi
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 23 October 2002

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… Expand

Characterization of Glushkov automata

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 paper… Expand

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

- J. Champarnaud, D. Ziadi
- Mathematics, Computer Science
- Fundam. Informaticae
- 5 January 2001

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… Expand

From C-Continuations to New Quadratic Algorithms for Automaton Synthesis

- J. Champarnaud, D. Ziadi
- Mathematics, Computer Science
- Int. J. Algebra Comput.
- 1 December 2001

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

A New Quadratic Algorithm to Convert a Regular Expression into an Automaton

- J. Ponty, D. Ziadi, J. Champarnaud
- Mathematics, Computer Science
- Workshop on Implementing Automata
- 29 August 1996

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-Klein… Expand

Passage d'une expression rationnelle à un automate fini non-déterministe

- D. Ziadi, J. Ponty, J. Champarnaud
- Mathematics
- 1997

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 automate… Expand

New Finite Automaton Constructions Based on Canonical Derivatives

- J. Champarnaud, D. Ziadi
- Computer Science, Mathematics
- CIAA
- 24 July 2000

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, introduced… Expand

Normalized Expressions and Finite Automata

- J. Champarnaud, F. Ouardi, D. Ziadi
- Mathematics, Computer Science
- Int. J. Algebra Comput.
- 1 February 2007

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 has… Expand

Computing the equation automaton of a regular expression in O(s2) space and time

- J. Champarnaud, D. Ziadi
- Mathematics
- 2001

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. The… Expand

- 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 position… Expand