Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Djelloul Ziadi"'
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 28, Iss 2, Pp 157-169 (2016)
In this paper, we address the problems of Arabic Text Classification and root extraction using transducers and rational kernels. We introduce a new root extraction approach on the basis of the use of Arabic patterns (Pattern Based Stemmer). Transduce
Externí odkaz:
https://doaj.org/article/99db138db2374572a79e19d7e0b9dba5
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 327-341 (2014)
There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, the position automaton P due to Glushkov, the c-continuation automaton C due to Champarnaud and Ziadi, the fol
Externí odkaz:
https://doaj.org/article/e1bb4745f13a428ab427335f3d6f767a
Publikováno v:
Journal of Computer Science. 17:776-788
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f47428dd407c7b6364f050dfcfbec32c
https://doi.org/10.3844/jcssp.2021.776.788
https://doi.org/10.3844/jcssp.2021.776.788
Publikováno v:
International Journal of Foundations of Computer Science. 31:1051-1068
The conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a top-down interpretation of tree automata. In this paper, we propose new constructions based on Glusko
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69af02a6875b2c1ee5e87877091890d5
https://doi.org/10.1142/s0129054120420034
https://doi.org/10.1142/s0129054120420034
Publikováno v:
2021 International Conference on Information Systems and Advanced Technologies (ICISAT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::166532c8338ebf7fbc8dad66065ddfed
https://doi.org/10.1109/icisat54145.2021.9678476
https://doi.org/10.1109/icisat54145.2021.9678476
In this paper, we extend the notion of (word) derivatives and partial derivatives due to (respectively) Brzozowski and Antimirov to tree derivatives using already known inductive formulae of quotients. We define a new family of extended regular tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb3edabc3ed829ec24a12a340da11f31
http://arxiv.org/abs/2107.13373
http://arxiv.org/abs/2107.13373
Publikováno v:
Kybernetika, 54(2), 221-242. Academy of Sciences of the Czech Republic
In this work we deal with tree pattern matching over ranked trees, where the pattern set to be matched against is defined by a regular tree expression. We present a new method that uses a tree automaton constructed inductively from a regular tree exp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2491d7260ed40954008ab231ffd00f8d
https://doi.org/10.14736/kyb-2018-2-0221
https://doi.org/10.14736/kyb-2018-2-0221
Publikováno v:
Procedia Computer Science. 128:9-17
Dialect is the most common way of communication in every day life. Automatically identifying a dialect is a challenging task, especially when we deal with close dialects within the same country. In this paper, we address the problem of Spoken Algeria
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72c14b3e55c490e0ebc1d56940bfacf3
https://doi.org/10.1016/j.procs.2018.03.002
https://doi.org/10.1016/j.procs.2018.03.002
Publikováno v:
Theory of Computing Systems. 62:1203-1222
In this paper, we propose a reduction of the minimization problem for a bottom-up deterministic tree automaton (DFTA), making the latter a minimization of a string deterministic finite automaton (DFA). To achieve this purpose, we proceed first by the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ca9faca56c11cdc0297977857b4a526
https://doi.org/10.1007/s00224-017-9815-4
https://doi.org/10.1007/s00224-017-9815-4
Publikováno v:
Knowledge and Information Systems. 53:439-477
Over the last two decades, a great deal of work has been devoted to the algorithmic aspects of the frequent itemset (FI) mining problem, leading to a phenomenal number of algorithms and associated implementations, each of which claims supremacy. Mean
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a7c1967a198b0fd323cf2a739f90b4b
https://doi.org/10.1007/s10115-017-1048-y
https://doi.org/10.1007/s10115-017-1048-y