Struct Dfa 

pub struct Dfa {
    pub alphabet: Vec<Symbol>,
    pub states: usize,
    pub start: usize,
    pub accepting: Vec<bool>,
    pub delta: Vec<Vec<usize>>,
}

Deterministic finite automaton learned by L*.

Fields

alphabet: Vec<Symbol>

Input alphabet in transition-column order.

states: usize

Number of states in the automaton.

start: usize

Start state index.

accepting: Vec<bool>

Accepting flag for each state.

delta: Vec<Vec<usize>>

Total transition function: delta[state][symbol_index] = next_state.

Implementations

impl Dfa

pub fn accepts(&self, word: &[Symbol]) -> bool

Returns true when word is accepted by this DFA.

pub fn accepts_text(&self, text: &str) -> bool

Convenience helper for character-level text input.

pub fn to_grammar(&self) -> Grammar

Converts this DFA to a right-linear grammar.

Trait Implementations

impl Clone for Dfa

fn clone(&self) -> Dfa

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Dfa

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

Formats the value using the given formatter.

impl PartialEq for Dfa

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Dfa

impl StructuralPartialEq for Dfa