4 citations · 7 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023★ 1 cited
Approximate Cartesian Tree Matching: an Approach Using Swaps
Bastien Auvray, Julien David, Richard Groult +1
Cartesian tree pattern matching consists of finding all the factors of a text that have the same Cartesian tree than a given pattern. There already exist theoretical and practical…
cs.DS2009★ 1 cited
On the Average Complexity of Moore's State Minimization Algorithm
Frédérique Bassino, Julien David, Cyril Nicaud
We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state…