rusty-alto 0.2.0

Weighted tree automata and interpreted regular tree grammars with Alto-compatible I/O
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

//! Automaton combinators.
//!
//! Combinators build new automata from existing ones without eagerly copying
//! all rules. In Phase 1 these are simple, correctness-oriented versions. They
//! are useful as building blocks and as a reference point for faster indexed
//! versions later.

mod determinized;
mod invhom;
mod mapped;
mod product;

pub use determinized::Determinized;
pub use invhom::InvHom;
pub use mapped::Mapped;
pub use product::Product;