Faissal Ouardi

Orcid: 0000-0002-7636-5001

According to our database1, Faissal Ouardi authored at least 15 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Efficient Algebraic Method for Testing the Invertibility of Finite State Machines.
Comput., June, 2023

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

2021
Composition of weighted finite transducers in MapReduce.
J. Big Data, 2021

Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce.
J. Big Data, 2021

Efficient Construction of the Equation Automaton.
Algorithms, 2021

2019
Assist and Architecture Requirements for SRAM using a 28nm Silicon Test Vehicle.
Proceedings of the BDIoT'19: The 4th International Conference On Big Data and Internet of Things, 2019

2015
Extended to multi-tilde-bar regular expressions and efficient finite automata constructions.
J. Discrete Algorithms, 2015

2009
An Efficient Computation of the Equation K-automaton of a Regular K-expression.
Fundam. Informaticae, 2009

2008
Fast equation automaton computation.
J. Discrete Algorithms, 2008

Efficient weighted expressions conversion.
RAIRO Theor. Informatics Appl., 2008

Relevant Representations for the Inference of Rational Stochastic Tree Languages.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007
Normalized Expressions and Finite Automata.
Int. J. Algebra Comput., 2007

An Efficient Computation of the Equation <i>K</i>-Automaton of a Regular <i>K</i>-Expression.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2004
From Regular Weighted Expressions To Finite Automata.
Int. J. Found. Comput. Sci., 2004

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


  Loading...