HIGHLIGHTS
- who: Faissal Ouardi and collaborators from the Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, d'Opale, Calais, France have published the paper: Efficient Construction of the Equation Automaton, in the Journal: Algorithms 2021, 14, 238. of /2021/
- what: The authors design an output-sensitive algorithm combining advantages of the previous algorithms and show that its computational complexity can be reduced to O(m × | Q≡e |) where | Q≡e | denotes the number of states of the equation automaton by an epsilon-removal and Bubenzer minimization algorithm of an Acyclic Deterministic Finite . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.