Jean-Eric Pin

Publication Activity (10 Years)

Years Active: 1978-2017
Publications (10 Years): 1

Top Topics

Automata Theory

Information Sciences

Computer Society

Top Venues

Dagstuhl Reports

Publications

Fedor V. Fomin, Christos H. Papadimitriou, Jean-Eric Pin
The EATCS Award 2017 - Laudatio for Eva Tardos. Bull. EATCS 121 (2017)
Mai Gehrke, Jean-Eric Pin, Victor L. Selivanov, Dieter Spreen
Duality in Computer Science (Dagstuhl Seminar 13311). Dagstuhl Reports 3 (7) (2013)
Jean-Eric Pin, Pedro V. Silva
On Profinite Uniform Structures Defined by Varieties of Finite Monoids. Int. J. Algebra Comput. 21 (1-2) (2011)
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo
The expressive power of the shuffle product. Inf. Comput. 208 (11) (2010)
Marats Golovkins, Jean-Eric Pin
Varieties Generated by Certain Models of Reversible Finite Automata. Chic. J. Theor. Comput. Sci. 2010 (2010)
Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas
10501 Executive Summary - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees (2010)
Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas
10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees (2010)
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
A Topological Approach to Recognition. ICALP (2) (2010)
Jean-Eric Pin
Profinite Methods in Automata Theory. STACS (2009)
Mário J. J. Branco, Jean-Eric Pin
Equations Defining the Polynomial Closure of a Lattice of Regular Languages. ICALP (2) (2009)
Olivier Carton, Dominique Perrin, Jean-Eric Pin
Automata and semigroups recognizing infinite words. Logic and Automata (2008)
Antonio Cano Gómez, Jean-Eric Pin
A Robust Class of Regular Languages. MFCS (2008)
Antonio Cano Gómez, Giovanna Guaiana, Jean-Eric Pin
When Does Partial Commutative Closure Preserve Regularity? ICALP (2) (2008)
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
Duality and Equational Theory of Regular Languages. ICALP (2) (2008)
Jean-Eric Pin, Pedro V. Silva
A Mahler's theorem for functions from words to integers. STACS (2008)
Laura Chaubard, Jean-Eric Pin, Howard Straubing
First Order Formulas with Modular Predicates. LICS (2006)
Laura Chaubard, Jean-Eric Pin, Howard Straubing
-varieties and concatenation product. Theor. Comput. Sci. 356 (1-2) (2006)
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
Operations preserving regular languages. Theor. Comput. Sci. 354 (3) (2006)
Marats Golovkins, Jean-Eric Pin
Varieties Generated by Certain Models of Reversible Finite Automata. COCOON (2006)
Jean-Eric Pin, Pedro V. Silva
A topological approach to transductions. Theor. Comput. Sci. 340 (1) (2005)
Jean-Eric Pin, Howard Straubing
Some results on $\cal C$-varieties. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Jean-Eric Pin
Expressive power of existential first-order sentences of Bu"chi's sequential calculus. Discret. Math. 291 (1-3) (2005)
Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov
Words Guaranteeing Minimum Image. Int. J. Found. Comput. Sci. 15 (2) (2004)
Antonio Cano Gómez, Jean-Eric Pin
Shuffle on positive varieties of languages. Theor. Comput. Sci. 312 (2-3) (2004)
Jean-Eric Pin
The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups. LATIN (2004)
Antonio Cano Gómez, Jean-Eric Pin
On a Conjecture of Schnoebelen. Developments in Language Theory (2003)
Stéphane Gaubert, Jean Jacques Loiseau, Jean Mairesse, Maurice Nivat, Jean-Eric Pin
Foreword. Theor. Comput. Sci. 293 (1) (2003)
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
Operations Preserving Recognizable Languages. FCT (2003)
Jean-Eric Pin
Algebraic tools for the concatenation product. Theor. Comput. Sci. 292 (1) (2003)
Jean-Eric Pin, Pascal Weil
A conjecture on the concatenation product. RAIRO Theor. Informatics Appl. 35 (6) (2001)
Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov
Words Guaranteeing Minimal Image. Words, Languages & Combinatorics (2000)
Jean-Eric Pin, Pascal Weil
Uniformities on Free Semigroups. Int. J. Algebra Comput. 9 (3-4) (1999)
Jean-Eric Pin
Positive Varieties and Infinite Words. LATIN (1998)
Jean-Eric Pin
Bridges for Concatenation Hierarchies. ICALP (1998)
Jean-Eric Pin, Pascal Weil
Ponynominal Closure and Unambiguous Product. Theory Comput. Syst. 30 (4) (1997)
Jean-Eric Pin
The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus. ICALP (1996)
Jean-Eric Pin
Polynomial Closure of Group Languages and Open Sets of the Hall Topology. Theor. Comput. Sci. 169 (2) (1996)
Jean-Eric Pin
Logic, Semigroups and Automata on Words. Ann. Math. Artif. Intell. 16 (1996)
Jean Berstel, Jean-Eric Pin
Local Languages and the Berry-Sethi Algorithm. Theor. Comput. Sci. 155 (2) (1996)
Jean-Eric Pin, Pascal Weil
Polynomial Closure and Unambiguous Product. ICALP (1995)
Irène Guessarian, Jean-Eric Pin
Linearizing Some Recursive Logic Programs. IEEE Trans. Knowl. Data Eng. 7 (1) (1995)
Jean-Eric Pin
A Negative Answer to a Question of Wilke on Varieties of \omega-Languages. Inf. Process. Lett. 56 (4) (1995)
Jean-Eric Pin
Polynomial Closure of Group Languages and Open Sets of the Hall Topology. ICALP (1994)
Jean-Eric Pin
Logic on Words. Bull. EATCS 54 (1994)
Jean-Eric Pin, Denis Thérien
The Bideterministic Concatenation Product. Int. J. Algebra Comput. 3 (4) (1993)
Christian Antoine, Bernard Le Goff, Jean-Eric Pin
A Graphic Language Based on Timing Diagrams. FSTTCS (1993)
Joëlle Cohen, Dominique Perrin, Jean-Eric Pin
On the Expressive Power of Temporal Logic. J. Comput. Syst. Sci. 46 (3) (1993)
Jean-Eric Pin
On Reversible Automata. LATIN (1992)
Jean-Eric Pin, Howard Straubing, Denis Thérien
Some Results on the Generalized Star-Height Problem Inf. Comput. 101 (2) (1992)
Danièle Beauquier, Jean-Eric Pin
Languages and Scanners. Theor. Comput. Sci. 84 (1) (1991)
Karsten Henckell, Stuart W. Margolis, Jean-Eric Pin, John Rhodes
Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I. Int. J. Algebra Comput. 1 (4) (1991)
Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil
Semigroups with Idempotent stabilizers and Applications to Automata Theory. Int. J. Algebra Comput. 1 (3) (1991)
Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. FSTTCS (1991)
Christopher J. Ash, T. E. Hall, Jean-Eric Pin
On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents Inf. Comput. 86 (1) (1990)
Danièle Beauquier, Jean-Eric Pin
Factors of Words. ICALP (1989)
Jean-Eric Pin, Howard Straubing, Denis Thérien
New Results on the Generalized Star-Height Problem. STACS (1989)
Jean-Marc Champarnaud, Jean-Eric Pin
A maxmin problem on finite automata. Discret. Appl. Math. 23 (1) (1989)
Jean Berstel, Maxime Crochemore, Jean-Eric Pin
Thue-Morse sequence and p-adic topology for the free monoid. Discret. Math. 76 (2) (1989)
Jean-Eric Pin
Relational morphisms, transductions and operations on languages. Formal Properties of Finite Automata and Applications (1988)
Jean-Eric Pin
On the Language Accepted by Finite Reversible Automata. ICALP (1987)
Dominique Perrin, Jean-Eric Pin
First-Order Logic and Star-Free Sets. J. Comput. Syst. Sci. 32 (3) (1986)
Jean-Eric Pin
Finite Group Topology and p-Adic Topology for Free Monoids. ICALP (1985)
Stuart W. Margolis, Jean-Eric Pin
Products of group languages. FCT (1985)
Jean-Eric Pin, Jacques Sakarovitch
Une Application de la Representation Matricielle des Transductions. Theor. Comput. Sci. 35 (1985)
Stuart W. Margolis, Jean-Eric Pin
Languages and Inverse Semigroups. ICALP (1984)
Jean-Eric Pin
Hiérarchies de Concaténation. RAIRO Theor. Informatics Appl. 18 (1) (1984)
Jean-Eric Pin
Star free omega-languages and first order logic. Automata on Infinite Words (1984)
Jean-Eric Pin
Arbres et Hierarchies de Concatenation. ICALP (1983)
Jean-Eric Pin, Jacques Sakarovitch
Some operations and transductions that preserve rationality. Theoretical Computer Science (1983)
Jean-Eric Pin, Imre Simon
A Note on the Triangle Conjecture. J. Comb. Theory, Ser. A 32 (1) (1982)
Jean-Eric Pin
Un analogue du théorème des variétés pour les cones et les cylindres. Theoretical Computer Science (1981)
Jean-Eric Pin
Languages reconnaissables et codage prefixe pur. ICALP (1981)
Jean-Eric Pin
Proprietes syntactiques du produit non ambigu. ICALP (1980)
Jean-Eric Pin
Une caractérisation de trois variétés de langages bien connues. Theoretical Computer Science (1979)
Jean-Eric Pin
Sur les mots synthronisants dans un automate fini. J. Inf. Process. Cybern. 14 (6) (1978)
Jean-Eric Pin
Lorsque L est un Langage Fini. Theor. Comput. Sci. 7 (1978)
Jean-Eric Pin
Sur un Cas Particulier de la Conjecture de Cerny. ICALP (1978)