(*									*)
(*  Le predicat isregular definit les langages reguliers.		*)
(*									*)

Definition isregular (l : wordset) : Prop :=
  exists q : Ensf,
    (exists qd : Ensf,
       (exists qa : Ensf,
          (exists d : Ensf,
             automate q qd qa d /\ eqwordset (reconnait q qd qa d) l))).Definition isregular_A (l : wordset) : Prop :=
  exists q : Ensf,
    (exists qd : Ensf,
       (exists qa : Ensf,
          (exists d : Ensf,
             automate_A q qd qa d /\ eqwordset (reconnait_A q qd qa d) l))).

(* Specifications: *)
Lemma isregular_A_isregular : forall l : wordset, isregular_A l -> isregular l.