+val transitions : t -> state -> ((label*formula) list)*((label*formula) list)
+(** Give the list of labels and formulae from queries and recognizing
+ transitions for a given state *)
+
+val empty : t
+(** The empty automaton *)
+
+val any_label : label
+(** Set of all labels which can occur in a tree *)
+
+val new_state : unit -> state
+(** Give a new state (different from all others states) *)
+
+val add_tr : t -> transition -> bool -> unit
+(** Add a query transition (recognizing transition if flag=false) to an asta *)
+
+val add_reco : t -> state -> unit
+(** Add a state to the recognizing states of an asta *)
+
+val add_quer : t -> state -> unit
+(** Add a state to the query states of an asta *)
+
+val add_selec : t -> state -> unit
+(** Add a state to the selecting states of an asta *)
+
+val add_bot : t -> state -> unit
+(** Add a state to the bottom states of an asta *)
+
+val add_top : t -> state -> unit
+(** Add a state to the top states of an asta *)
+
+val init_top : t -> unit
+(** Remove all top states *)
+
+val top_states : t -> state list
+(** Give the list of top states of an ASTA *)