Parameter Make.A

type s = S.t
type t
module State : Automata.WFA.S with type t = Base.int
val mk : s Base.list -> s Base.list Automata.Char.map -> s Base.list -> t

mk init trans out constructs a WFA from flat lists. init has length n (one entry per state). trans maps each character to a flat list of length n² (row-major). out has length n.

val outs : t -> Automata.Word.t -> s

outs aut w evaluates the WFA on word w, returning iota · M(w) · lambda.

val to_string : t -> Base.string
val stats : t -> Automata.WFA.stats
val stats_to_string : t -> Base.string