Functor Automaton.Make

module Make: 
functor (X : Alphabet.T) -> sig .. end

module States: Alphabet.Pow(Automaton.State)

module T: Alphabet.Map(Alphabet.Prod(Automaton.State)(X))(States)

module Regexp: Automaton.Regexp(X)

type t = {

val states : t -> int

val trans : t -> State.t -> X.t -> States.t

val add_transition : t -> State.t -> X.t -> State.t -> t

val create : int ->
       State.t ->
       States.S.elt list ->
       (State.t * X.t * State.t) list -> t

val kleene : t -> Regexp.t