default search action
Djelloul Ziadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Souad Taouti, Hadda Cherroun, Djelloul Ziadi:
Parallel Tree Kernel Computation. ICPRAM 2024: 329-336 - 2023
- [i14]Ludovic Mignot, Faissal Ouardi, Djelloul Ziadi:
New Linear-time Algorithm for SubTree Kernel Computation based on Root-Weighted Tree Automata. CoRR abs/2302.01097 (2023) - [i13]Souad Taouti, Hadda Cherroun, Djelloul Ziadi:
Parallel Tree Kernel Computation. CoRR abs/2305.07717 (2023) - 2021
- [j31]Samira Attou
, Ludovic Mignot, Djelloul Ziadi:
Bottom-Up derivatives of tree expressions. RAIRO Theor. Informatics Appl. 55: 1-21 (2021) - [j30]Slimane Bellaouar, Hadda Cherroun
Weighted automata sequence kernel: Unification and generalization. Knowl. Based Syst. 212: 106654 (2021) - [i12]Samira Attou, Ludovic Mignot, Djelloul Ziadi:
Bottom-Up Derivatives of Tree Expressions. CoRR abs/2107.13373 (2021) - 2020
- [j29]Samira Attou, Ludovic Mignot, Djelloul Ziadi:
The Bottom-Up Position Tree Automaton and the Father Automaton. Int. J. Found. Comput. Sci. 31(8): 1051-1068 (2020)
2010 – 2019
- 2019
- [c22]Samira Attou, Ludovic Mignot, Djelloul Ziadi:
Extended tree expressions and their derivatives. NCMA 2019: 47-62 - 2018
- [j28]Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi:
Efficient geometric-based computation of the string subsequence kernel. Data Min. Knowl. Discov. 32(2): 532-559 (2018) - [j27]Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi:
An Efficient Algorithm for the Construction of the Equation Tree Automaton. Int. J. Found. Comput. Sci. 29(6): 951-978 (2018) - [j26]Ahlem Belabbaci, Hadda Cherroun, Loek Cleophas
Tree pattern matching from regular tree expressions. Kybernetika 54(2): 221-242 (2018) - [j25]Younes Guellouma
From Tree Automata to String Automata Minimization. Theory Comput. Syst. 62(5): 1203-1222 (2018) - [c21]Samira Attou, Ludovic Mignot, Djelloul Ziadi:
The Bottom-Up Position Tree Automaton and Its Compact Version. CIAA 2018: 59-70 - [i11]Samira Attou, Ludovic Mignot, Djelloul Ziadi:
The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions. CoRR abs/1805.08584 (2018) - 2017
- [j24]Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi:
Tree Automata Constructions from Regular Expressions: a Comparative Study. Fundam. Informaticae 156(1): 69-94 (2017) - [j23]Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi:
Bottom-Up Quotients for Tree Languages. J. Autom. Lang. Comb. 22(4): 243-269 (2017) - [j22]Slimane Oulad-Naoui
A formal series-based unification of the frequent itemset mining approaches. Knowl. Inf. Syst. 53(2): 439-477 (2017) - [c20]Slimane Bellaouar, Hadda Cherroun, Attia Nehar, Djelloul Ziadi:
Weighted Automata Sequence Kernel. ICMLC 2017: 48-55 - [i10]Soumia Bougrine, Hadda Cherroun, Djelloul Ziadi:
Hierarchical Classification for Spoken Arabic Dialect Identification using Prosody: Case of Algerian Dialects. CoRR abs/1703.10065 (2017) - 2016
- [j21]Attia Nehar, Djelloul Ziadi, Hadda Cherroun:
Rational kernels for Arabic Root Extraction and Text Classification. J. King Saud Univ. Comput. Inf. Sci. 28(2): 157-169 (2016) - 2015
- [j20]Faissal Ouardi, Jean-Marc Champarnaud, Djelloul Ziadi:
Extended to multi-tilde-bar regular expressions and efficient finite automata constructions. J. Discrete Algorithms 33: 58-70 (2015) - [c19]Slimane Oulad-Naoui
A Unifying Polynomial Model for Efficient Discovery of Frequent Itemsets. DATA 2015: 49-59 - [c18]Soumia Bougrine, Hadda Cherroun, Djelloul Ziadi:
Prosody-based Spoken Algerian Arabic Dialect Identification. ICNLSP 2015: 9-17 - [i9]Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi:
Root-Weighted Tree Automata and their Applications to Tree Kernels. CoRR abs/1501.03895 (2015) - [i8]Younes Guellouma, Ludovic Mignot, Hadda Cherroun, Djelloul Ziadi:
Construction of rational expression from tree automata using a generalization of Arden's Lemma. CoRR abs/1501.07686 (2015) - [i7]Nadia Ouali Sebti, Djelloul Ziadi:
Algorithm for the k-Position Tree Automaton Construction. CoRR abs/1502.06194 (2015) - [i6]Attia Nehar, Djelloul Ziadi, Hadda Cherroun:
Rational Kernels for Arabic Stemming and Text Classification. CoRR abs/1502.07504 (2015) - [i5]Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi:
Efficient Geometric-based Computation of the String Subsequence Kernel. CoRR abs/1502.07776 (2015) - [i4]Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi:
Bottom Up Quotients and Residuals for Tree Languages. CoRR abs/1506.02863 (2015) - 2014
- [j19]Mohamed Dahmoune, el Houcein el Abdalaoui, Djelloul Ziadi:
On the Transition Reduction Problem for Finite Automata. Fundam. Informaticae 132(1): 79-94 (2014) - [c17]Attia Nehar, Abdelkader Benmessaoud, Hadda Cherroun, Djelloul Ziadi:
Subsequence kernels-based Arabic text classification. AICCSA 2014: 206-213 - [c16]Ludovic Mignot
An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations. CiE 2014: 303-313 - [c15]Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi:
Efficient List-Based Computation of the String Subsequence Kernel. LATA 2014: 138-148 - [c14]Ludovic Mignot
$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions. AFL 2014: 327-341 - [i3]Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi:
An Efficient Algorithm for the Equation Tree Automaton via the $k$-C-Continuations. CoRR abs/1401.5951 (2014) - 2013
- [c13]Éric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi:
From Regular Tree Expression to Position Tree Automaton. LATA 2013: 395-406 - [c12]Attia Nehar, Djelloul Ziadi, Hadda Cherroun:
Rational Kernels for Arabic Text Classification. SLSP 2013: 176-187 - [i2]el Houcein el Abdalaoui, Mohamed Dahmoune, Djelloul Ziadi:
On the transition reduction problem for finite automata. CoRR abs/1301.3751 (2013) - [i1]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions. CoRR abs/1306.3507 (2013)
2000 – 2009
- 2009
- [j18]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
An Efficient Computation of the Equation K-automaton of a Regular K-expression. Fundam. Informaticae 90(1-2): 1-16 (2009) - [c11]Younes Guellouma
Supervised learning and automatic recognition of asphalt pavement deteriorations. AICCSA 2009: 205-210 - 2008
- [j17]Éric Laugerotte, Djelloul Ziadi:
WeightedWord Recognition. Fundam. Informaticae 83(3): 277-298 (2008) - [j16]Faissal Ouardi, Djelloul Ziadi:
Efficient weighted expressions conversion. RAIRO Theor. Informatics Appl. 42(2): 285-307 (2008) - [j15]Ahmed Khorsi, Faissal Ouardi, Djelloul Ziadi:
Fast equation automaton computation. J. Discrete Algorithms 6(3): 433-448 (2008) - 2007
- [j14]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
Normalized Expressions and Finite Automata. Int. J. Algebra Comput. 17(1): 141-154 (2007) - [c10]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
An Efficient Computation of the Equation K-Automaton of a Regular K-Expression. Developments in Language Theory 2007: 145-156 - 2006
- [j13]Jean-Marc Champarnaud, Florent Nicart
From the ZPC Structure of a Regular Expression to its Follow Automaton. Int. J. Algebra Comput. 16(1): 17-34 (2006) - 2004
- [j12]Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi:
A characterization of Thompson digraphs. Discret. Appl. Math. 134(1-3): 317-337 (2004) - [j11]Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi:
From Regular Weighted Expressions To Finite Automata. Int. J. Found. Comput. Sci. 15(5): 687-700 (2004) - [j10]Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi:
Random Generation Models for NFAs. J. Autom. Lang. Comb. 9(2/3): 203-216 (2004) - [c9]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
Follow Automaton versus Equation Automaton. DCFS 2004: 145-153 - [c8]Jean-Marc Champarnaud, Florent Nicart
Computing the Follow Automaton of an Expression. CIAA 2004: 90-101 - 2003
- [c7]Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi:
From Regular Weighted Expressions to Finite Automata. CIAA 2003: 49-60 - 2002
- [j9]Jean-Marc Champarnaud, Djelloul Ziadi:
Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289(1): 137-163 (2002) - [c6]Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi:
NFAs bitstream-based random generation. DCFS 2002: 81-94 - 2001
- [j8]Jean-Marc Champarnaud, Djelloul Ziadi:
From Mirkin's Prebases to Antimirov's Word Partial Derivatives. Fundam. Informaticae 45(3): 195-205 (2001) - [j7]Jean-Marc Champarnaud, Djelloul Ziadi:
From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. Int. J. Algebra Comput. 11(6): 707-736 (2001) - [j6]Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi:
Foreword. Theor. Comput. Sci. 267(1-2): 1 (2001) - [c5]Jean-Marc Champarnaud, Djelloul Ziadi:
Computing the Equation Automaton of a Regular Expression in Space and Time. CPM 2001: 157-168 - 2000
- [j5]Djelloul Ziadi:
Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems. Theor. Comput. Sci. 231(1): 75-87 (2000) - [j4]Pascal Caron, Djelloul Ziadi:
Characterization of Glushkov automata. Theor. Comput. Sci. 233(1-2): 75-90 (2000) - [c4]Jean-Marc Champarnaud, Djelloul Ziadi:
New Finite Automaton Constructions Based on Canonical Derivatives. CIAA 2000: 94-104
1990 – 1999
- 1999
- [j3]Jean-Marc Champarnaud, Jean-Luc Ponty, Djelloul Ziadi:
From regular expressions to finite automata. Int. J. Comput. Math. 72(4): 415-431 (1999) - [j2]Djelloul Ziadi, Jean-Marc Champarnaud:
An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton. Theor. Comput. Sci. 215(1-2): 69-87 (1999) - [e1]Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi:
Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers. Lecture Notes in Computer Science 1660, Springer 1999, ISBN 3-540-66652-4 [contents] - 1998
- [c3]Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty:
Determinization of Glushkov Automata. Workshop on Implementing Automata 1998: 57-68 - 1997
- [c2]Djelloul Ziadi:
Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems. Workshop on Implementing Automata 1997: 241-251 - 1996
- [j1]Djelloul Ziadi:
Regular Expression for a Language without Empty Word. Theor. Comput. Sci. 163(1&2): 309-315 (1996) - [c1]Jean-Luc Ponty, Djelloul Ziadi, Jean-Marc Champarnaud:
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton. Workshop on Implementing Automata 1996: 109-119
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: