| 2009 |
|---|
| 62 | EE | Jean-Eric Pin:
Profinite Methods in Automata Theory.
STACS 2009: 31-50 |
| 2008 |
|---|
| 61 | EE | Antonio Cano Gómez,
Giovanna Guaiana,
Jean-Eric Pin:
When Does Partial Commutative Closure Preserve Regularity?
ICALP (2) 2008: 209-220 |
| 60 | EE | Mai Gehrke,
Serge Grigorieff,
Jean-Eric Pin:
Duality and Equational Theory of Regular Languages.
ICALP (2) 2008: 246-257 |
| 59 | EE | Antonio Cano Gómez,
Jean-Eric Pin:
A Robust Class of Regular Languages.
MFCS 2008: 36-51 |
| 58 | EE | Jean-Eric Pin,
Pedro V. Silva:
A Mahler's theorem for functions from words to integers.
STACS 2008: 585-596 |
| 2006 |
|---|
| 57 | EE | Marats Golovkins,
Jean-Eric Pin:
Varieties Generated by Certain Models of Reversible Finite Automata.
COCOON 2006: 83-93 |
| 56 | EE | Laura Chaubard,
Jean-Eric Pin,
Howard Straubing:
First Order Formulas with Modular Ppredicates.
LICS 2006: 211-220 |
| 55 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Bruno Petazzoni,
Jean-Eric Pin:
Operations preserving regular languages.
Theor. Comput. Sci. 354(3): 405-420 (2006) |
| 54 | EE | Laura Chaubard,
Jean-Eric Pin,
Howard Straubing:
Actions, wreath products of C-varieties and concatenation product.
Theor. Comput. Sci. 356(1-2): 73-89 (2006) |
| 2005 |
|---|
| 53 | EE | Jean-Eric Pin:
Expressive power of existential first-order sentences of Bu"chi's sequential calculus.
Discrete Mathematics 291(1-3): 155-174 (2005) |
| 52 | EE | Jean-Eric Pin,
Pedro V. Silva:
A topological approach to transductions.
Theor. Comput. Sci. 340(1): 443-456 (2005) |
| 2004 |
|---|
| 51 | EE | Jean-Eric Pin:
The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups.
LATIN 2004: 5 |
| 50 | EE | Stuart W. Margolis,
Jean-Eric Pin,
Mikhail V. Volkov:
Words Guaranteeing Minimum Image.
Int. J. Found. Comput. Sci. 15(2): 259-276 (2004) |
| 49 | EE | Antonio Cano Gómez,
Jean-Eric Pin:
Shuffle on positive varieties of languages.
Theor. Comput. Sci. 312(2-3): 433-461 (2004) |
| 2003 |
|---|
| 48 | EE | Antonio Cano Gómez,
Jean-Eric Pin:
On a Conjecture of Schnoebelen.
Developments in Language Theory 2003: 35-54 |
| 47 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Bruno Petazzoni,
Jean-Eric Pin:
Operations Preserving Recognizable Languages.
FCT 2003: 343-354 |
| 46 | | Jean-Eric Pin:
Algebraic tools for the concatenation product.
Theor. Comput. Sci. 292(1): 317-342 (2003) |
| 2001 |
|---|
| 45 | | Jean-Eric Pin:
Logic on Words.
Current Trends in Theoretical Computer Science 2001: 254-273 |
| 44 | EE | Jean-Eric Pin,
Pascal Weil:
A conjecture on the concatenation product.
ITA 35(6): 597-618 (2001) |
| 1998 |
|---|
| 43 | EE | Jean-Eric Pin:
Bridges for Concatenation Hierarchies.
ICALP 1998: 431-442 |
| 42 | EE | Jean-Eric Pin:
Positive Varieties and Infinite Words.
LATIN 1998: 76-87 |
| 1997 |
|---|
| 41 | | Jean-Eric Pin,
Pascal Weil:
Ponynominal Closure and Unambiguous Product.
Theory Comput. Syst. 30(4): 383-422 (1997) |
| 1996 |
|---|
| 40 | | Jean-Eric Pin:
The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus.
ICALP 1996: 300-311 |
| 39 | | Jean-Eric Pin:
Logic, Semigroups and Automata on Words.
Ann. Math. Artif. Intell. 16: 343-384 (1996) |
| 38 | EE | Jean Berstel,
Jean-Eric Pin:
Local Languages and the Berry-Sethi Algorithm.
Theor. Comput. Sci. 155(2): 439-446 (1996) |
| 37 | EE | Jean-Eric Pin:
Polynomial Closure of Group Languages and Open Sets of the Hall Topology.
Theor. Comput. Sci. 169(2): 185-200 (1996) |
| 1995 |
|---|
| 36 | | Jean-Eric Pin,
Pascal Weil:
Polynomial Closure and Unambiguous Product.
ICALP 1995: 348-359 |
| 35 | EE | Irène Guessarian,
Jean-Eric Pin:
Linearizing Some Recursive Logic Programs.
IEEE Trans. Knowl. Data Eng. 7(1): 137-149 (1995) |
| 34 | EE | Jean-Eric Pin:
A Negative Answer to a Question of Wilke on Varieties of \omega-Languages.
Inf. Process. Lett. 56(4): 197-200 (1995) |
| 1994 |
|---|
| 33 | | Jean-Eric Pin:
Polynomial Closure of Group Languages and Open Sets of the Hall Topology.
ICALP 1994: 424-435 |
| 32 | | Jean-Eric Pin:
Logic on Words.
Bulletin of the EATCS 54: 145-165 (1994) |
| 1993 |
|---|
| 31 | | Christian Antoine,
Bernard Le Goff,
Jean-Eric Pin:
A Graphic Language Based on Timing Diagrams.
FSTTCS 1993: 306-316 |
| 30 | | Joëlle Cohen,
Dominique Perrin,
Jean-Eric Pin:
On the Expressive Power of Temporal Logic.
J. Comput. Syst. Sci. 46(3): 271-294 (1993) |
| 1992 |
|---|
| 29 | | Jean-Eric Pin:
On Reversible Automata.
LATIN 1992: 401-416 |
| 28 | | Jean-Eric Pin,
Howard Straubing,
Denis Thérien:
Some Results on the Generalized Star-Height Problem
Inf. Comput. 101(2): 219-250 (1992) |
| 1991 |
|---|
| 27 | | Bertrand Le Saëc,
Jean-Eric Pin,
Pascal Weil:
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words.
FSTTCS 1991: 141-151 |
| 26 | | Danièle Beauquier,
Jean-Eric Pin:
Languages and Scanners.
Theor. Comput. Sci. 84(1): 3-21 (1991) |
| 1990 |
|---|
| 25 | | 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): 32-42 (1990) |
| 1989 |
|---|
| 24 | | Jean-Eric Pin:
Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 25-29, 1987, Proceedings
Springer 1989 |
| 23 | | Danièle Beauquier,
Jean-Eric Pin:
Factors of Words.
ICALP 1989: 63-79 |
| 22 | | Jean-Eric Pin,
Howard Straubing,
Denis Thérien:
New Results on the Generalized Star-Height Problem.
STACS 1989: 458-467 |
| 21 | EE | Jean-Marc Champarnaud,
Jean-Eric Pin:
A maxmin problem on finite automata.
Discrete Applied Mathematics 23(1): 91-96 (1989) |
| 20 | EE | Jean Berstel,
Maxime Crochemore,
Jean-Eric Pin:
Thue-Morse sequence and p-adic topology for the free monoid.
Discrete Mathematics 76(2): 89-94 (1989) |
| 1988 |
|---|
| 19 | | Jean-Eric Pin:
Relational morphisms, transductions and operations on languages.
Formal Properties of Finite Automata and Applications 1988: 34-55 |
| 1987 |
|---|
| 18 | | Jean-Eric Pin:
On the Language Accepted by Finite Reversible Automata.
ICALP 1987: 237-249 |
| 1986 |
|---|
| 17 | | Dominique Perrin,
Jean-Eric Pin:
First-Order Logic and Star-Free Sets.
J. Comput. Syst. Sci. 32(3): 393-406 (1986) |
| 1985 |
|---|
| 16 | | Stuart W. Margolis,
Jean-Eric Pin:
Products of group languages.
FCT 1985: 285-299 |
| 15 | | Jean-Eric Pin:
Finite Group Topology and p-Adic Topology for Free Monoids.
ICALP 1985: 445-455 |
| 14 | | Jean-Eric Pin,
Jacques Sakarovitch:
Une Application de la Representation Matricielle des Transductions.
Theor. Comput. Sci. 35: 271-293 (1985) |
| 1984 |
|---|
| 13 | | Jean-Eric Pin:
Star free omega-languages and first order logic.
Automata on Infinite Words 1984: 56-67 |
| 12 | | Stuart W. Margolis,
Jean-Eric Pin:
Languages and Inverse Semigroups.
ICALP 1984: 337-346 |
| 11 | | Jean-Eric Pin:
Hiérarchies de Concaténation.
ITA 18(1): 23-46 (1984) |
| 1983 |
|---|
| 10 | | Jean-Eric Pin:
Arbres et Hierarchies de Concatenation.
ICALP 1983: 617-628 |
| 9 | | Jean-Eric Pin,
Jacques Sakarovitch:
Some operations and transductions that preserve rationality.
Theoretical Computer Science 1983: 277-288 |
| 1982 |
|---|
| 8 | | Jean-Eric Pin,
Imre Simon:
A Note on the Triangle Conjecture.
J. Comb. Theory, Ser. A 32(1): 106-109 (1982) |
| 1981 |
|---|
| 7 | | Jean-Eric Pin:
Languages reconnaissables et codage prefixe pur.
ICALP 1981: 184-192 |
| 6 | | Jean-Eric Pin:
Un analogue du théorème des variétés pour les cones et les cylindres.
Theoretical Computer Science 1981: 78-90 |
| 1980 |
|---|
| 5 | | Jean-Eric Pin:
Proprietes syntactiques du produit non ambigu.
ICALP 1980: 483-499 |
| 1979 |
|---|
| 4 | | Jean-Eric Pin:
Une caractérisation de trois variétés de langages bien connues.
Theoretical Computer Science 1979: 233-243 |
| 1978 |
|---|
| 3 | | Jean-Eric Pin:
Sur un Cas Particulier de la Conjecture de Cerny.
ICALP 1978: 345-352 |
| 2 | | Jean-Eric Pin:
Sur les mots synthronisants dans un automate fini.
Elektronische Informationsverarbeitung und Kybernetik 14(6): 297-303 (1978) |
| 1 | | Jean-Eric Pin:
Sur le Monoide Syntactique de L Lorsque L est un Langage Fini.
Theor. Comput. Sci. 7: 211-215 (1978) |
