end
(** Modules representing the Boolean formulae used in transitions *)
-module Transition : Hcons.S with type data = State.t * QNameSet.t * Formula.t
+module Transition : sig
+ include Hcons.S with type data = State.t * QNameSet.t * Formula.t
+ val print : Format.formatter -> t -> unit
+end
(** A [Transition.t] is a hashconsed triple of the state, the set of labels and the formula *)
type t
(** 2-way Selecting Alternating Tree Automata *)
+val uid : t -> Uid.t
+(** return the internal unique ID of the automaton *)
+
val get_states : t -> StateSet.t
(** return the set of states of the automaton *)
nodes [N], [a'' N = a' (a N)].
*)
+val merge : t -> t -> t
+(** [merge a a'] creates a new automaton [a''] that evaluates both [a] and [a'']
+ in parallel
+*)
+
module Builder :
sig
type auto = t