Pierre Simonnet

According to our database, Pierre Simonnet authored at least 9 papers between 1999 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Elementary remarks about Pisano periods.

Gérard H. E. Duchamp, Pierre Simonnet

CoRR, 2022

2015

An upper bound on the complexity of recognizable tree languages.

Olivier Finkel, Dominique Lecomte, Pierre Simonnet

RAIRO Theor. Informatics Appl., 2015

2009

On Recognizable Tree Languages Beyond the Borel Hierarchy.

Olivier Finkel, Pierre Simonnet

Fundam. Informaticae, 2009

2008

On the continuity set of an Omega rational function.

Olivier Carton, Olivier Finkel, Pierre Simonnet

RAIRO Theor. Informatics Appl., 2008

On Infinite Real Trace Rational Languages of Maximum Topological Complexity

Olivier Finkel, Jean-Pierre Ressayre, Pierre Simonnet

CoRR, 2008

Topology and Ambiguity in Omega Context Free Languages

Olivier Finkel, Pierre Simonnet

CoRR, 2008

2007

Automata, Borel functions and real numbers in Pisot base.

Benoit Cagnard, Pierre Simonnet

RAIRO Theor. Informatics Appl., 2007

Baire and Automata.

Benoit Cagnard, Pierre Simonnet

Discret. Math. Theor. Comput. Sci., 2007

1999

Decision Issues on Functions Realized by Finite Automata.

Christian Choffrut, Hratchia Pélibossian, Pierre Simonnet

J. Autom. Lang. Comb., 1999