Djelloul Ziadi

Learn More
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(More)
Glushkov algorithm computes a nondeterministic nite automaton without-transition and with n + 1 states from a simple regular expression having n occurrences of letters. The aim of this paper is to give a set of necessary and suucient conditions characterizing this automaton. Our characterization theorem is formulated in terms of directed graphs. Moreover(More)
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, and the equation automaton which can be computed via Mirkin’s prebases or Antimirov’s partial derivatives. Let |E| be the size of the expression and ‖E‖ be its(More)
Using N-gram technique without stemming is not appropriate in the context of Arabic Text Classification. For this, we introduce a new stemming technique, which we call “approximate-stemming”, based on the use of Arabic patterns. These are modeled using transducers and stemming is done without depending on any dictionary. This stemmer will be(More)