Struct MinDfa 

pub struct MinDfa { /* private fields */ }

Minimal complete automaton with canonical numbering.

Implementations

impl MinDfa

pub fn num_states(&self) -> usize

Number of states.

pub fn num_classes(&self) -> usize

Number of symbol classes after merging indistinguishable ones.

pub fn classes(&self) -> &[CharSet]

Symbol classes, ordered by smallest member.

pub fn is_accepting(&self, s: usize) -> bool

Is state s accepting?

pub fn next(&self, s: usize, class: usize) -> usize

Transition table lookup.

pub fn accepts(&self, input: &[u32]) -> bool

Full-match test on the minimal automaton.

pub fn canonical_form(&self) -> String

Exact textual form; equal strings iff equal languages (same alphabet).

pub fn fingerprint(&self) -> String

SHA-256 of the canonical form: the language fingerprint (FR-B04). The canonical form is the authority; the hash is its compact name.

Trait Implementations

impl Clone for MinDfa

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MinDfa

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for MinDfa

impl PartialEq for MinDfa

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for MinDfa