Correct TP algorithm with fixed point (to be tested).

[tatoo.git] / src / asta.mli

diff --git a/src/asta.mli b/src/asta.mli
index 7bbf13d..3fd9886 100644 (file)
--- a/src/asta.mli
+++ b/src/asta.mli
@@ -42,6 +42,10 @@ val transitions_lab : t -> QName.t -> (state*formula) list *(state*formula) list
 (** Give the list of states and formulae from queries and recognizing
     transitions for a given tag *)
 
+val transitions_st_lab : t -> state -> QName.t -> formula list * formula list
+(** Give the list of formulae from queries and recognizing transitions for a
+    given state and tag *)
+
 val empty : t
 (** The empty automaton *)