+(** [get_trans auto l q] returns the list of transitions taken by [auto]
+ for label [l] in state [q]. Takes time proportional to the number of
+ transitions in the automaton.
+ *)
+
+val get_form : t -> QNameSet.elt -> State.t -> Formula.t
+(** [get_form auto l q] returns a single formula for label [l] in state [q].
+ Takes time proportional to the number of transitions in the automaton.
+ *)
+
+val print : Format.formatter -> t -> unit
+(** Pretty printing of the automaton *)
+
+val copy : t -> t
+(** [copy a] creates a copy of automaton [a], that is a new automaton with
+ the same transitions but with fresh states, such that [get_states a] and
+ [get_states (copy a)] are distinct
+*)
+val concat : t -> t -> t
+(** [concat a a'] creates a new automaton [a''] such that, given a set of tree
+ nodes [N], [a'' N = a' (a N)].
+*)