default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFaissal Ouardi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Zineb Lotfi, Hamid Khalifi
, Faissal Ouardi:
Efficient Algebraic Method for Testing the Invertibility of Finite State Machines. Comput. 11(7): 125 (2023)- [e1]François Coste, Faissal Ouardi, Guillaume Rabusseau:
International Conference on Grammatical Inference, ICGI 2023, 10-13 July 2023, Rabat, Morocco. Proceedings of Machine Learning Research 217, PMLR 2023 [contents] - [i2]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) - 2021
- [j9]Faissal Ouardi, Zineb Lotfi, Bilal Elghadyry:
Efficient Construction of the Equation Automaton. Algorithms 14(8): 238 (2021) - [j8]Bilal Elghadyry, Faissal Ouardi, Sébastien Vérel:
Composition of weighted finite transducers in MapReduce. J. Big Data 8(1): 1-15 (2021) - [j7]Bilal Elghadyry, Faissal Ouardi, Zineb Lotfi, Sébastien Vérel:
Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce. J. Big Data 8(1): 145 (2021)
2010 – 2019
- 2019
- [c5]Kenza Charafeddine, Faissal Ouardi:
Assist and Architecture Requirements for SRAM using a 28nm Silicon Test Vehicle. BDIoT 2019 - 2015
- [j6]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) - 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
- [j5]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) - 2008
- [j4]Faissal Ouardi, Djelloul Ziadi:
Efficient weighted expressions conversion. RAIRO Theor. Informatics Appl. 42(2): 285-307 (2008) - [j3]Ahmed Khorsi, Faissal Ouardi, Djelloul Ziadi:
Fast equation automaton computation. J. Discrete Algorithms 6(3): 433-448 (2008) - [c4]François Denis, Édouard Gilbert, Amaury Habrard, Faissal Ouardi, Marc Tommasi:
Relevant Representations for the Inference of Rational Stochastic Tree Languages. ICGI 2008: 57-70 - 2007
- [j2]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
Normalized Expressions and Finite Automata. Int. J. Algebra Comput. 17(1): 141-154 (2007) - [c3]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 - 2004
- [j1]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) - [c2]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi:
Follow Automaton versus Equation Automaton. DCFS 2004: 145-153 - 2003
- [c1]Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi:
From Regular Weighted Expressions to Finite Automata. CIAA 2003: 49-60
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-04-25 05:38 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:
