Struct tree_automata::alternating::Automaton

pub struct Automaton<F: Symbol, Q: State, I> { /* fields omitted */ }

Alternating tree automaton.

Implementations

impl<F: Symbol, Q: State, I> Automaton<F, Q, I>

pub fn new() -> Automaton<F, Q, I>

Create a new empty alternating tree automaton.

pub fn states(&self) -> Keys<'_, Q, HashMap<F, Clause<Q, I>>>

pub fn clauses_for_state(&self, q: &Q) -> Iter<'_, F, Clause<Q, I>>

pub fn add(&mut self, state: &Q, symbol: &F, conjuction: Conjuction<Q, I>)

Add the given conjuction to the clause (state, symbol).

pub fn is_initial(&self, q: &Q) -> bool

pub fn set_initial(&mut self, q: Q) -> bool

Set the given state an initial state. Return true if the state was not already initial. Return false if it was already an initial state.

pub fn map_states<R: State, M>(&self, g: M) -> Automaton<F, R, I> where
    M: Fn(&Q) -> R,
    I: Clone, 

impl<F: Symbol, Q: State> Automaton<F, Q, u32>

pub fn add_transition(
    &mut self,
    bottom_up::Configuration: &Configuration<F, Q>,
    state: &Q
)

Add a bottom-up transition. It is added as a clause to the corresponding (state, symbol) pair.

Trait Implementations

impl<'a, F: Symbol, Q: State, L: Label> From<&'a Automaton<F, Q, L>> for Automaton<F, Q, u32>

fn from(bottom_up: &'a Automaton<F, Q, L>) -> Automaton<F, Q, u32>

Performs the conversion.