Module laps_regex::dfa

source ·
Expand description

Deterministic finite automaton (DFA) related implementations.

A DFA can be built from a nondeterministic finite automaton (NFA).

Structs

  • DFA
    A deterministic finite automaton (DFA) with symbol type S and tag type T.

Type Aliases

  • FATags
    A pair of DFA’s internal finite automaton and the tag map.