(***********************************************************************)
(*                                                                     *)
(*                               TAToo                                 *)
(*                                                                     *)
(*                  ?   *)
(*                  ?   *)
(*                                                                     *)
(*  Copyright 2010-2012 Université Paris-Sud and Centre National de la *)
(*  Recherche Scientifique. All rights reserved.  This file is         *)
(*  distributed under the terms of the GNU Lesser General Public       *)
(*  License, with the special exception on linking described in file   *)
(*  ../LICENSE.                                                        *)
(*                                                                     *)
(***********************************************************************)

(** Implementation of alternating selecting tree automata (ASTA) *)

type state
(** The type of states *)

type label
(** The type of labels of the transitions *)

type formula
(** The type of transition formulae *)

type t
(** The type of ASTAs *)

val transition : t -> state -> label -> formula
(** Give the formula which must hold for a current state and label *)

val transitions : t -> state -> (label*formula) list
(** Give the list of labels and formulae from transitions for a given state *)

val print : Format.formatter -> t -> unit
(** Describe the automaton as text *)

val to_file : out_channel -> t -> unit
(** Outputs the description of the automaton on the given out_channel *)