8 citations · 8 across the 7 of their papers we have counts for
1 paper · 1 filter
Erwan Mahe, Boutheina Bannour, Christophe Gaston +2
Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach…