• An assessment of algorithms for deriving failure deterministic finite automata 

      Nxumalo, Madoda; Kourie, Derrick G.; Cleophas, Loek; Watson, Bruce W. (South African Institute of Computer Scientists and Information Technologists, 2017)
      Failure deterministic finite automata (FDFAs) represent regular languages more compactly than deterministic finite automata (DFAs). Four algorithms that convert arbitrary DFAs to language-equivalent FDFAs are empirically ...