Djelloul Ziadi

Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods, 2024

2023

New Linear-time Algorithm for SubTree Kernel Computation based on Root-Weighted Tree Automata.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Weighted automata sequence kernel: Unification and generalization.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2021

Bottom-Up derivatives of tree expressions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2021

2020

The Bottom-Up Position Tree Automaton and the Father Automaton.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

2019

Extended tree expressions and their derivatives.

[BibT_eX]

Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

2018

From Tree Automata to String Automata Minimization.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Tree pattern matching from regular tree expressions.

[BibT_eX]

[DOI]

Kybernetika, 2018

An Efficient Algorithm for the Construction of the Equation Tree Automaton.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Efficient geometric-based computation of the string subsequence kernel.

[BibT_eX]

[DOI]

Slimane Bellaouar

Data Min. Knowl. Discov., 2018

The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions.

[BibT_eX]

[DOI]

CoRR, 2018

The Bottom-Up Position Tree Automaton and Its Compact Version.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

2017

A formal series-based unification of the frequent itemset mining approaches.

[BibT_eX]

[DOI]

Slimane Oulad-Naoui

Knowl. Inf. Syst., 2017

Bottom-Up Quotients for Tree Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Tree Automata Constructions from Regular Expressions: a Comparative Study.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Hierarchical Classification for Spoken Arabic Dialect Identification using Prosody: Case of Algerian Dialects.

[BibT_eX]

[DOI]

Soumia Bougrine

CoRR, 2017

Weighted Automata Sequence Kernel.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Machine Learning and Computing, 2017

2016

Rational kernels for Arabic Root Extraction and Text Classification.

[BibT_eX]

[DOI]

J. King Saud Univ. Comput. Inf. Sci., 2016

2015

Extended to multi-tilde-bar regular expressions and efficient finite automata constructions.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Algorithm for the k-Position Tree Automaton Construction.

[BibT_eX]

[DOI]

CoRR, 2015

Rational Kernels for Arabic Stemming and Text Classification.

[BibT_eX]

[DOI]

CoRR, 2015

Root-Weighted Tree Automata and their Applications to Tree Kernels.

[BibT_eX]

[DOI]

CoRR, 2015

Construction of rational expression from tree automata using a generalization of Arden's Lemma.

[BibT_eX]

[DOI]

CoRR, 2015

Bottom Up Quotients and Residuals for Tree Languages.

[BibT_eX]

[DOI]

CoRR, 2015

Prosody-based Spoken Algerian Arabic Dialect Identification.

[BibT_eX]

[DOI]

Soumia Bougrine

Proceedings of the 1st International Conference on Natural Language and Speech Processing, 2015

A Unifying Polynomial Model for Efﬁcient Discovery of Frequent Itemsets.

[BibT_eX]

[DOI]

Slimane Oulad-Naoui

Proceedings of the DATA 2015, 2015

2014

On the Transition Reduction Problem for Finite Automata.

[BibT_eX]

[DOI]

Mohamed Dahmoune

el Houcein el Abdalaoui

Fundam. Informaticae, 2014

$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Efficient List-Based Computation of the String Subsequence Kernel.

[BibT_eX]

[DOI]

Slimane Bellaouar

Proceedings of the Language and Automata Theory and Applications, 2014

An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations.

[BibT_eX]

[DOI]

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

Subsequence kernels-based Arabic text classification.

[BibT_eX]

[DOI]

Abdelkader Benmessaoud

Proceedings of the 11th IEEE/ACS International Conference on Computer Systems and Applications, 2014

2013

Rational Kernels for Arabic Text Classification.

[BibT_eX]

[DOI]

Proceedings of the Statistical Language and Speech Processing, 2013

From Regular Tree Expression to Position Tree Automaton.

[BibT_eX]

[DOI]

Éric Laugerotte

Proceedings of the Language and Automata Theory and Applications, 2013

2009

An Efficient Computation of the Equation K-automaton of a Regular K-expression.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Supervised learning and automatic recognition of asphalt pavement deteriorations.

[BibT_eX]

[DOI]

Proceedings of the 7th IEEE/ACS International Conference on Computer Systems and Applications, 2009

2008

Fast equation automaton computation.

[BibT_eX]

[DOI]

Ahmed Khorsi

J. Discrete Algorithms, 2008

Efficient weighted expressions conversion.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

WeightedWord Recognition.

[BibT_eX]

[DOI]

Éric Laugerotte

Fundam. Informaticae, 2008

2007

Normalized Expressions and Finite Automata.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2007

An Efficient Computation of the Equation <i>K</i>-Automaton of a Regular <i>K</i>-Expression.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

From the ZPC Structure of a Regular Expression to its Follow Automaton.

[BibT_eX]

[DOI]

Florent Nicart

Int. J. Algebra Comput., 2006

2004

Random Generation Models for NFAs.

[BibT_eX]

[DOI]

Georges Hansel

Thomas Paranthoën

J. Autom. Lang. Comb., 2004

From Regular Weighted Expressions To Finite Automata.

[BibT_eX]

[DOI]

Éric Laugerotte

Int. J. Found. Comput. Sci., 2004

A characterization of Thompson digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Computing the Follow Automaton of an Expression.

[BibT_eX]

[DOI]

Florent Nicart

Proceedings of the Implementation and Application of Automata, 2004

Follow Automaton versus Equation Automaton.

[BibT_eX]

Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2002

Canonical derivatives, partial derivatives and finite automaton constructions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

NFAs bitstream-based random generation.

[BibT_eX]

Georges Hansel

Thomas Paranthoën

Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001

Foreword.

[BibT_eX]

[DOI]

Denis Maurel

Theor. Comput. Sci., 2001

From C-Continuations to New Quadratic Algorithms for Automaton Synthesis.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2001

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

Computing the Equation Automaton of a Regular Expression in Space and Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Characterization of Glushkov automata.

[BibT_eX]

[DOI]

Pascal Caron

Theor. Comput. Sci., 2000

New Finite Automaton Constructions Based on Canonical Derivatives.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2000

1999

An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

From regular expressions to finite automata.

[BibT_eX]

[DOI]

Jean-Luc Ponty

Int. J. Comput. Math., 1999

1998

Determinization of Glushkov Automata.

[BibT_eX]

[DOI]

Jean-Luc Ponty

Proceedings of the Automata Implementation, 1998

1996

Regular Expression for a Language without Empty Word.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

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

[BibT_eX]

[DOI]

Jean-Luc Ponty