Struct Automaton

pub struct Automaton { /* private fields */ }

Deterministic finite state automaton

Implementations

impl Automaton

pub fn initial_state(&self) -> &State

Get the initial state

pub fn state(&self, id: usize) -> &State

Get a state from its id panics if the id is out of range

pub fn num_states(&self) -> usize

Number of states

pub fn num_final_states(&self) -> usize

Number of final states

pub fn default_successor(&self, s: &State) -> Option<&State>

Default successor of a state

pub fn class_next(&self, s: &State, cid: ClassId) -> &State

Successor for a character class

The class id must be valid for state s

Panics

If cid is of the form ClassId::Interval(i) but i is larger than the number of successors of s.

If cid is of the form ClassId::Complement but s has no default successor.

pub fn char_set_next(&self, s: &State, set: &CharSet) -> Result<&State, Error>

Successor of a state via a character set

Errors

If this set overlaps two or more successor classes, produce Error::AmbiguousCharSet.

pub fn next(&self, s: &State, c: u32) -> &State

Successor of a state via a character

pub fn str_next<'a>(&'a self, s: &'a State, str: &SmtString) -> &'a State

Successor of a state via an SMT string

pub fn accepts(&self, str: &SmtString) -> bool

Check whether an SMT string is accepted

pub fn states(&self) -> impl Iterator<Item = &State>

Iterator to got through the states

pub fn edges<'a>(&'a self, s: &'a State) -> EdgeIterator<'a>

Iterator to list the out edges of a state

The iterator produces a list of pairs (ClassId, SuccessorState) for every class in the state’s character partition.

pub fn final_states(&self) -> FinalStateIterator<'_>

Iterator to list the final states

pub fn combined_char_partition(&self) -> CharPartition

Merge the state partitions and return the result. This returns an abstraction of the automaton’s alphabet.

Every class in the returned partition contains equivalent characters: if c1 and c2 are in one class, then delta(s, c1) = delta(s, c2) for every state s of the automaton.

pub fn pick_alphabet(&self) -> Vec<u32>

Get a representative character from the combined partition

pub fn compile_successors(&self) -> CompactTable

Compile the successor function.

The successor function is defined on state indices and character indices and it returns a state index. More precisely, it starts with building the representative alphabet for this automaton (see pick_alphabet). If the automaton has N states and the representative alphabet has M characters, then the compiled successor function is defined on [0 .. N-1] x [0 .. M-1] and return an index in [0 .. N-1].

pub fn remove_unreachable_states(&mut self)

Remove unreachable states

pub fn minimize(&mut self)

Minimize the automaton

Trait Implementations

impl Debug for Automaton

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

Formats the value using the given formatter.

impl Display for Automaton

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

Formats the value using the given formatter.