Jean-Pierre Ressayre

Learn More
We describe the Wadge hierarchy of the ω-languages recognized by determin-istic Petri nets. This is an extension of the celebrated Wagner hierarchy which turned out to be the Wadge hierarchy of the ω-regular languages. Petri nets are more powerful devices than finite automata. They may be defined as partially blind multi-counter automata. We show that the(More)
This paper presents the contents of a talk given in December 1990, during the second “Journées sur les Arithmétiques Faibles” held at the LITP, Paris; the talk was repeated during the 1991 Ecole de Printemps of Méjannes le Clap. The paper proves a polynomial time computability result for a class of NP inter co-NP problems, for which only the obvious(More)
We consider the set R ω (Γ, D) of infinite real traces, over a dependence alphabet (Γ, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real traces are analytic sets. We reprove also that there exist some rational languages of infinite real traces which are analytic(More)