Incremental Construction of Compact Acyclic NFAs: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:4903:49, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,427 bytes +1,427‎ Created page with "Title: Incremental Construction of Compact Acyclic NFAs Research Question: How can we efficiently construct non-deterministic finite-state automata (NFAs) that are compact and acyclic, especially useful for lexicon representation and fast string matching? Methodology: The authors proposed an incremental algorithm for the construction of acyclic NFAs. This algorithm is an improvement over previous methods, as it creates NFAs that do not contain equivalent states. This p..."
Retrieved from "https://simplesci.org/wiki/Incremental_Construction_of_Compact_Acyclic_NFAs"