Jean-Éric Pin

According to our database1, Jean-Éric Pin
  • authored at least 101 papers between 1978 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
On uniformly continuous functions for some profinite topologies.
Theor. Comput. Sci., 2017

Preface.
Theory Comput. Syst., 2017

The EATCS Award 2017 - Laudatio for Eva Tardos.
Bulletin of the EATCS, 2017

A survey on difference hierarchies of regular languages.
CoRR, 2017

Commutative positive varieties of languages.
CoRR, 2017

Commutative Positive Varieties of Languages.
Acta Cybern., 2017

Some Results of Zoltán Ésik on Regular Languages.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

The Dot-Depth Hierarchy, 45 Years Later.
Proceedings of the Role of Theory in Computer Science, 2017

Open Problems About Regular Languages, 35 Years Later.
Proceedings of the Role of Theory in Computer Science, 2017

Dual Space of a Lattice as the Completion of a Pervin Space - Extended Abstract.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2017

2016
Ultrafilters on words for a fragment of logic.
Theor. Comput. Sci., 2016

Varieties of Cost Functions.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015
On fixed points of the lower set operator.
IJAC, 2015

Newton Series, Coinductively.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Newton's Forward Difference Equation for Functions from Words to Words.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
A noncommutative extension of Mahler's theorem on interpolation series.
Eur. J. Comb., 2014

From Ultrafilters on Words to the Expressive Power of a Fragment of Logic.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
Regular languages and partial commutations.
Inf. Comput., 2013

Duality in Computer Science (Dagstuhl Seminar 13311).
Dagstuhl Reports, 2013

An Explicit Formula for the Intersection of Two Polynomials of Regular Languages.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Equational Descriptions of Languages.
Int. J. Found. Comput. Sci., 2012

2011
On Profinite Uniform Structures Defined by Varieties of Finite Monoids.
IJAC, 2011

Theme and Variations on the Concatenation Product.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

Equational descriptions of languages.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
The expressive power of the shuffle product.
Inf. Comput., 2010

Varieties Generated by Certain Models of Reversible Finite Automata.
Chicago J. Theor. Comput. Sci., 2010

A Topological Approach to Recognition.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

10501 Executive Summary - Advances and Applications of Automata on Words and Trees.
Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees.
Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

2009
Languages Recognized by Finite Supersoluble Groups.
Journal of Automata, Languages and Combinatorics, 2009

Profinite Methods in Automata Theory.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Equations Defining the Polynomial Closure of a Lattice of Regular Languages.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
A Mahler's theorem for functions from words to integers.
Proceedings of the STACS 2008, 2008

A Robust Class of Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

When Does Partial Commutative Closure Preserve Regularity?
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Duality and Equational Theory of Regular Languages.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Automata and semigroups recognizing infinite words.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2006
Actions, wreath products of C-varieties and concatenation product.
Theor. Comput. Sci., 2006

Operations preserving regular languages.
Theor. Comput. Sci., 2006

First Order Formulas with Modular Predicates.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Varieties Generated by Certain Models of Reversible Finite Automata.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
A topological approach to transductions.
Theor. Comput. Sci., 2005

Some results on $\cal C$-varieties.
ITA, 2005

Expressive power of existential first-order sentences of Bu"chi's sequential calculus.
Discrete Mathematics, 2005

2004
Shuffle on positive varieties of languages.
Theor. Comput. Sci., 2004

Words Guaranteeing Minimum Image.
Int. J. Found. Comput. Sci., 2004

The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Algebraic tools for the concatenation product.
Theor. Comput. Sci., 2003

Foreword.
Theor. Comput. Sci., 2003

Operations Preserving Recognizable Languages.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

On a Conjecture of Schnoebelen.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2001
A conjecture on the concatenation product.
ITA, 2001

Logic on Words.
Current Trends in Theoretical Computer Science, 2001

2000
Words Guaranteeing Minimal Image.
Proceedings of the International Colloquium on Words, 2000

1999
Uniformities on Free Semigroups.
IJAC, 1999

Marcel-Paul Schützenberger (1920-1996).
IJAC, 1999

1998
Positive Varieties and Infinite Words.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Bridges for Concatenation Hierarchies.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Ponynominal Closure and Unambiguous Product.
Theory Comput. Syst., 1997

1996
Polynomial Closure of Group Languages and Open Sets of the Hall Topology.
Theor. Comput. Sci., 1996

Local Languages and the Berry-Sethi Algorithm.
Theor. Comput. Sci., 1996

Logic, Semigroups and Automata on Words.
Ann. Math. Artif. Intell., 1996

The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
Linearizing Some Recursive Logic Programs.
IEEE Trans. Knowl. Data Eng., 1995

A Negative Answer to a Question of Wilke on Varieties of \omega-Languages.
Inf. Process. Lett., 1995

Polynomial Closure and Unambiguous Product.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Logic on Words.
Bulletin of the EATCS, 1994

Polynomial Closure of Group Languages and Open Sets of the Hall Topology.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
On the Expressive Power of Temporal Logic.
J. Comput. Syst. Sci., 1993

The Bideterministic Concatenation Product.
IJAC, 1993

A Graphic Language Based on Timing Diagrams.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992
Some Results on the Generalized Star-Height Problem
Inf. Comput., December, 1992

On Reversible Automata.
Proceedings of the LATIN '92, 1992

1991
Languages and Scanners.
Theor. Comput. Sci., 1991

Semigroups with Idempotent stabilizers and Applications to Automata Theory.
IJAC, 1991

Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I.
IJAC, 1991

A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990
On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents
Inf. Comput., May, 1990

1989
Thue-Morse sequence and p-adic topology for the free monoid.
Discrete Mathematics, 1989

A maxmin problem on finite automata.
Discrete Applied Mathematics, 1989

New Results on the Generalized Star-Height Problem.
Proceedings of the STACS 89, 1989

Factors of Words.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
Relational morphisms, transductions and operations on languages.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

1987
On the Language Accepted by Finite Reversible Automata.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
First-Order Logic and Star-Free Sets.
J. Comput. Syst. Sci., 1986

1985
Une Application de la Representation Matricielle des Transductions.
Theor. Comput. Sci., 1985

Finite Group Topology and p-Adic Topology for Free Monoids.
Proceedings of the Automata, 1985

Products of group languages.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Hiérarchies de Concaténation.
ITA, 1984

Star free omega-languages and first order logic.
Proceedings of the Automata on Infinite Words, 1984

Languages and Inverse Semigroups.
Proceedings of the Automata, 1984

1983
Some operations and transductions that preserve rationality.
Proceedings of the Theoretical Computer Science, 1983

Arbres et Hierarchies de Concatenation.
Proceedings of the Automata, 1983

1982
A Note on the Triangle Conjecture.
J. Comb. Theory, Ser. A, 1982

1981
Un analogue du théorème des variétés pour les cones et les cylindres.
Proceedings of the Theoretical Computer Science, 1981

Languages reconnaissables et codage prefixe pur.
Proceedings of the Automata, 1981

1980
Proprietes syntactiques du produit non ambigu.
Proceedings of the Automata, 1980

1979
Une caractérisation de trois variétés de langages bien connues.
Proceedings of the Theoretical Computer Science, 1979

1978
Sur le Monoide Syntactique de L Lorsque L est un Langage Fini.
Theor. Comput. Sci., 1978

Sur les mots synthronisants dans un automate fini.
Elektronische Informationsverarbeitung und Kybernetik, 1978

Sur un Cas Particulier de la Conjecture de Cerny.
Proceedings of the Automata, 1978


  Loading...