Sur un Cas Particulier de la Conjecture de Cerny. - Jean-Eric Pin (ICALP, 1978)

Sur les mots synthronisants dans un automate fini. - Jean-Eric Pin (J. Inf. Process. Cybern., 1978)

Sur le Monoide Syntactique de L* Lorsque L est un Langage Fini. - Jean-Eric Pin (Theor. Comput. Sci., 1978)

Une caractérisation de trois variétés de langages bien connues. - Jean-Eric Pin (Theoretical Computer Science, 1979)

Proprietes syntactiques du produit non ambigu. - Jean-Eric Pin (ICALP, 1980)

Languages reconnaissables et codage prefixe pur. - Jean-Eric Pin (ICALP, 1981)

Un analogue du théorème des variétés pour les cones et les cylindres. - Jean-Eric Pin (Theoretical Computer Science, 1981)

A Note on the Triangle Conjecture. - Jean-Eric Pin; Imre Simon (J. Comb. Theory A, 1982)

Arbres et Hierarchies de Concatenation. - Jean-Eric Pin (ICALP, 1983)

Some operations and transductions that preserve rationality. - Jean-Eric Pin; Jacques Sakarovitch (Theoretical Computer Science, 1983)

Languages and Inverse Semigroups. - Stuart W. Margolis; Jean-Eric Pin (ICALP, 1984)

Star free omega-languages and first order logic. - Jean-Eric Pin (Automata on Infinite Words, 1984)

Hiérarchies de Concaténation. - Jean-Eric Pin (RAIRO Theor. Informatics Appl., 1984)

Products of group languages. - Stuart W. Margolis; Jean-Eric Pin (FCT, 1985)

Finite Group Topology and p-Adic Topology for Free Monoids. - Jean-Eric Pin (ICALP, 1985)

Une Application de la Representation Matricielle des Transductions. - Jean-Eric Pin; Jacques Sakarovitch (Theor. Comput. Sci., 1985)

First-Order Logic and Star-Free Sets. - Dominique Perrin; Jean-Eric Pin (J. Comput. Syst. Sci., 1986)

On the Language Accepted by Finite Reversible Automata. - Jean-Eric Pin (ICALP, 1987)

Relational morphisms, transductions and operations on languages. - Jean-Eric Pin (Formal Properties of Finite Automata and Applications, 1988)

Factors of Words. - Danièle Beauquier; Jean-Eric Pin (ICALP, 1989)

New Results on the Generalized Star-Height Problem. - Jean-Eric Pin; Howard Straubing; Denis Thérien (STACS, 1989)

A maxmin problem on finite automata. - Jean-Marc Champarnaud; Jean-Eric Pin (Discret. Appl. Math., 1989)

Thue-Morse sequence and p-adic topology for the free monoid. - Jean Berstel; Maxime Crochemore; Jean-Eric Pin (Discret. Math., 1989)

On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents - Christopher J. Ash; Thomas Eric Hall; Jean-Eric Pin (Inf. Comput., 1990)

A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. - Bertrand Le Saëc; Jean-Eric Pin; Pascal Weil (FSTTCS, 1991)

Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I. - Karsten Henckell; Stuart W. Margolis; Jean-Eric Pin; John Rhodes 001 (Int. J. Algebra Comput., 1991)

Semigroups with Idempotent stabilizers and Applications to Automata Theory. - Bertrand Le Saëc; Jean-Eric Pin; Pascal Weil (Int. J. Algebra Comput., 1991)

Languages and Scanners. - Danièle Beauquier; Jean-Eric Pin (Theor. Comput. Sci., 1991)

On Reversible Automata. - Jean-Eric Pin (LATIN, 1992)

Some Results on the Generalized Star-Height Problem - Jean-Eric Pin; Howard Straubing; Denis Thérien (Inf. Comput., 1992)

A Graphic Language Based on Timing Diagrams. - Christian Antoine; Bernard Le Goff; Jean-Eric Pin (FSTTCS, 1993)

The Bideterministic Concatenation Product. - Jean-Eric Pin; Denis Thérien (Int. J. Algebra Comput., 1993)

On the Expressive Power of Temporal Logic. - Joëlle Cohen; Dominique Perrin; Jean-Eric Pin (J. Comput. Syst. Sci., 1993)

Logic on Words. - Jean-Eric Pin (Bull. EATCS, 1994)

Polynomial Closure and Unambiguous Product. - Jean-Eric Pin; Pascal Weil (ICALP, 1995)

A Negative Answer to a Question of Wilke on Varieties of omega-Languages. - Jean-Eric Pin (Inf. Process. Lett., 1995)

Linearizing Some Recursive Logic Programs. - Irène Guessarian; Jean-Eric Pin (IEEE Trans. Knowl. Data Eng., 1995)

The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus. - Jean-Eric Pin (ICALP, 1996)

Logic, Semigroups and Automata on Words. - Jean-Eric Pin (Ann. Math. Artif. Intell., 1996)

Local Languages and the Berry-Sethi Algorithm. - Jean Berstel; Jean-Eric Pin (Theor. Comput. Sci., 1996)

Polynomial Closure of Group Languages and Open Sets of the Hall Topology. - Jean-Eric Pin (Theor. Comput. Sci., 1996)

Ponynominal Closure and Unambiguous Product. - Jean-Eric Pin; Pascal Weil (Theory Comput. Syst., 1997)

Syntactic Semigroups. - Jean-Eric Pin (Handbook of Formal Languages (1), 1997)

Bridges for Concatenation Hierarchies. - Jean-Eric Pin (ICALP, 1998)

Positive Varieties and Infinite Words. - Jean-Eric Pin (LATIN, 1998)

Marcel-Paul Schützenberger (1920-1996). - Jean-Éric Pin (Int. J. Algebra Comput., 1999)

Uniformities on Free Semigroups. - Jean-Eric Pin; Pascal Weil (Int. J. Algebra Comput., 1999)

Words Guaranteeing Minimal Image. - Stuart W. Margolis; Jean-Eric Pin; Mikhail V. Volkov 001 (Words, Languages & Combinatorics, 2000)

Logic on Words. - Jean-Eric Pin (Current Trends in Theoretical Computer Science, 2001)

A conjecture on the concatenation product. - Jean-Eric Pin; Pascal Weil (RAIRO Theor. Informatics Appl., 2001)

On a Conjecture of Schnoebelen. - Antonio Cano Gómez; Jean-Eric Pin (Developments in Language Theory, 2003)

Operations Preserving Recognizable Languages. - Jean Berstel; Luc Boasson; Olivier Carton; Bruno Petazzoni; Jean-Eric Pin (FCT, 2003)

Foreword. - Stéphane Gaubert; Jean Jacques Loiseau; Jean Mairesse; Maurice Nivat; Jean-Eric Pin (Theor. Comput. Sci., 2003)

Algebraic tools for the concatenation product. - Jean-Eric Pin (Theor. Comput. Sci., 2003)

Infinite words - automata, semigroups, logic and games. - Dominique Perrin; Jean-Eric Pin (Elsevier Morgan Kaufmann, 2004)

The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups. - Jean-Eric Pin (LATIN, 2004)

Words Guaranteeing Minimum Image. - Stuart W. Margolis; Jean-Eric Pin; Mikhail V. Volkov 001 (Int. J. Found. Comput. Sci., 2004)

Shuffle on positive varieties of languages. - Antonio Cano Gómez; Jean-Eric Pin (Theor. Comput. Sci., 2004)

Expressive power of existential first-order sentences of Bu"chi's sequential calculus. - Jean-Eric Pin (Discret. Math., 2005)

Some results on C-varieties. - Jean-Eric Pin; Howard Straubing (RAIRO Theor. Informatics Appl., 2005)

A topological approach to transductions. - Jean-Eric Pin; Pedro V. Silva (Theor. Comput. Sci., 2005)

First Order Formulas with Modular Predicates. - Laura Chaubard; Jean-Eric Pin; Howard Straubing (LICS, 2006)

Operations preserving regular languages. - Jean Berstel; Luc Boasson; Olivier Carton; Bruno Petazzoni; Jean-Eric Pin (Theor. Comput. Sci., 2006)

Actions, wreath products of C-varieties and concatenation product. - Laura Chaubard; Jean-Eric Pin; Howard Straubing (Theor. Comput. Sci., 2006)

Automata and semigroups recognizing infinite words. - Olivier Carton; Dominique Perrin; Jean-Eric Pin (Logic and Automata, 2008)

Duality and Equational Theory of Regular Languages. - Mai Gehrke; Serge Grigorieff; Jean-Eric Pin (ICALP (2), 2008)

When Does Partial Commutative Closure Preserve Regularity? - Antonio Cano Gómez; Giovanna Guaiana; Jean-Eric Pin (ICALP (2), 2008)

A Robust Class of Regular Languages. - Antonio Cano Gómez; Jean-Eric Pin (MFCS, 2008)

A Mahler's theorem for functions from words to integers. - Jean-Eric Pin; Pedro V. Silva (STACS, 2008)

Equations Defining the Polynomial Closure of a Lattice of Regular Languages. - Mário J. J. Branco; Jean-Eric Pin (ICALP (2), 2009)

Profinite Methods in Automata Theory. - Jean-Eric Pin (STACS, 2009)

Languages Recognized by Finite Supersoluble Groups. - Olivier Carton; Jean-Éric Pin; Xaro Soler-Escrivà (J. Autom. Lang. Comb., 2009)

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. - Christian Glaßer; Jean-Eric Pin; Nicole Schweikardt; Victor L. Selivanov; Wolfgang Thomas (Advances and Applications of Automata on Words and Trees, 2010)

10501 Executive Summary - Advances and Applications of Automata on Words and Trees. - Christian Glaßer; Jean-Eric Pin; Nicole Schweikardt; Victor L. Selivanov; Wolfgang Thomas (Advances and Applications of Automata on Words and Trees, 2010)

A Topological Approach to Recognition. - Mai Gehrke; Serge Grigorieff; Jean-Eric Pin (ICALP (2), 2010)

Varieties Generated by Certain Models of Reversible Finite Automata. - Marats Golovkins; Jean-Eric Pin (Chic. J. Theor. Comput. Sci., 2010)

The expressive power of the shuffle product. - Jean Berstel; Luc Boasson; Olivier Carton; Jean-Eric Pin; Antonio Restivo (Inf. Comput., 2010)

Theme and Variations on the Concatenation Product. - Jean-Éric Pin (CAI, 2011)

On Profinite Uniform Structures Defined by Varieties of Finite Monoids. - Jean-Eric Pin; Pedro V. Silva (Int. J. Algebra Comput., 2011)

Equational Descriptions of Languages. - Jean-Éric Pin (Int. J. Found. Comput. Sci., 2012)

An Explicit Formula for the Intersection of Two Polynomials of Regular Languages. - Jean-Éric Pin (Developments in Language Theory, 2013)

Duality in Computer Science (Dagstuhl Seminar 13311). - Mai Gehrke; Jean-Eric Pin; Victor L. Selivanov; Dieter Spreen (Dagstuhl Reports, 2013)

Regular languages and partial commutations. - Antonio Cano Gómez; Giovanna Guaiana; Jean-Éric Pin (Inf. Comput., 2013)

From Ultrafilters on Words to the Expressive Power of a Fragment of Logic. - Mai Gehrke; Andreas Krebs; Jean-Éric Pin (DCFS, 2014)

A noncommutative extension of Mahler's theorem on interpolation series. - Jean-Éric Pin; Pedro V. Silva (Eur. J. Comb., 2014)

Newton's Forward Difference Equation for Functions from Words to Words. - Jean-Éric Pin (CiE, 2015)

Newton Series, Coinductively. - Henning Basold; Helle Hvid Hansen; Jean-Éric Pin; Jan Rutten (ICTAC, 2015)

On fixed points of the lower set operator. - Jorge Almeida 001; Antonio Cano; Ondrej Klíma 001; Jean-Éric Pin (Int. J. Algebra Comput., 2015)

Varieties of Cost Functions. - Laure Daviaud; Denis Kuperberg; Jean-Éric Pin (STACS, 2016)

Ultrafilters on words for a fragment of logic. - Mai Gehrke; Andreas Krebs; Jean-Éric Pin (Theor. Comput. Sci., 2016)

Dual Space of a Lattice as the Completion of a Pervin Space - Extended Abstract. - Jean-Éric Pin (RAMiCS, 2017)

Open Problems About Regular Languages, 35 Years Later. - Jean-Éric Pin (The Role of Theory in Computer Science, 2017)

The Dot-Depth Hierarchy, 45 Years Later. - Jean-Éric Pin (The Role of Theory in Computer Science, 2017)

Some Results of Zoltán Ésik on Regular Languages. - Jean-Éric Pin (FCT, 2017)

Commutative Positive Varieties of Languages. - Jorge Almeida 001; Zoltán Ésik; Jean-Éric Pin (Acta Cybern., 2017)

The EATCS Award 2017 - Laudatio for Eva Tardos. - Fedor V. Fomin; Christos H. Papadimitriou; Jean-Eric Pin (Bull. EATCS, 2017)

The EATCS Award 2018 - Call for Nominations. - Jean-Éric Pin (Bull. EATCS, 2017)

Preface. - Andrei A. Bulatov; Edward A. Hirsch; Jean-Éric Pin (Theory Comput. Syst., 2017)

On uniformly continuous functions for some profinite topologies. - Jean-Éric Pin; Pedro V. Silva (Theor. Comput. Sci., 2017)

Inequalities for One-Step Products. - Mário J. J. Branco; Jean-Éric Pin (DLT, 2018)

A survey on difference hierarchies of regular languages. - Olivier Carton; Dominique Perrin; Jean-Éric Pin (Log. Methods Comput. Sci., 2018)

A Mahler's Theorem for Word Functions. - Jean-Éric Pin; Christophe Reutenauer (ICALP, 2019)

Newton series, coinductively: a comparative study of composition. - Henning Basold; Helle Hvid Hansen; Jean-Éric Pin; Jan Rutten (Math. Struct. Comput. Sci., 2019)

Languages and formations generated by D4 and Q8. - Jean-Éric Pin; Xaro Soler-Escrivà (Theor. Comput. Sci., 2019)

How to Prove that a Language Is Regular or Star-Free? - Jean-Éric Pin (LATA, 2020)

Finite automata. - Jean-Éric Pin (Handbook of Automata Theory (I.), 2021)

Shuffle Product of Regular Languages: Results and Open Problems. - Jean-Éric Pin (CAI, 2022)

Preface. - Miroslav Ciric 001; Manfred Droste; Jean-Éric Pin (Inf. Comput., 2024)

Euclidean division by d in base b. - Jean-Éric Pin (Theor. Comput. Sci., 2025)