Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Éric Pin
Jean-Eric Pin
Person information
- affiliation: University Paris-Diderot, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2004
[b1]Dominique Perrin, Jean-Eric Pin:
Infinite words - automata, semigroups, logic and games. Pure and applied mathematics series 141, Elsevier Morgan Kaufmann 2004, ISBN 978-0-12-532111-2, pp. I-XI, 1-538
Journal Articles
- 2019
- [j51]Henning Basold
, Helle Hvid Hansen, Jean-Éric Pin, Jan Rutten:
Newton series, coinductively: a comparative study of composition. Math. Struct. Comput. Sci. 29(1): 38-66 (2019) - [j50]Jean-Éric Pin, Xaro Soler-Escrivà:
Languages and formations generated by D4 and Q8. Theor. Comput. Sci. 800: 155-172 (2019) - 2018
- [j49]Olivier Carton, Dominique Perrin, Jean-Éric Pin:
A survey on difference hierarchies of regular languages. Log. Methods Comput. Sci. 14(1) (2018) - 2017
- [j48]Jorge Almeida, Zoltán Ésik, Jean-Éric Pin:
Commutative Positive Varieties of Languages. Acta Cybern. 23(1): 91-111 (2017) - [j47]Fedor V. Fomin, Christos H. Papadimitriou, Jean-Eric Pin:
The EATCS Award 2017 - Laudatio for Eva Tardos. Bull. EATCS 121 (2017) - [j46]Jean-Éric Pin:
The EATCS Award 2018 - Call for Nominations. Bull. EATCS 123 (2017) - [j45]Andrei A. Bulatov, Edward A. Hirsch, Jean-Éric Pin:
Preface. Theory Comput. Syst. 61(2): 261-262 (2017) - [j44]Jean-Éric Pin, Pedro V. Silva:
On uniformly continuous functions for some profinite topologies. Theor. Comput. Sci. 658: 246-262 (2017) - 2016
- [j43]Mai Gehrke, Andreas Krebs, Jean-Éric Pin:
Ultrafilters on words for a fragment of logic. Theor. Comput. Sci. 610: 37-58 (2016) - 2015
- [j42]Jorge Almeida, Antonio Cano, Ondrej Klíma, Jean-Éric Pin:
On fixed points of the lower set operator. Int. J. Algebra Comput. 25(1-2): 259-292 (2015) - 2014
- [j41]Jean-Éric Pin, Pedro V. Silva:
A noncommutative extension of Mahler's theorem on interpolation series. Eur. J. Comb. 36: 564-578 (2014) - 2013
- [j40]Antonio Cano Gómez, Giovanna Guaiana, Jean-Éric Pin:
Regular languages and partial commutations. Inf. Comput. 230: 76-96 (2013) - 2012
- [j39]Jean-Éric Pin:
Equational Descriptions of Languages. Int. J. Found. Comput. Sci. 23(6): 1227-1240 (2012) - 2011
- [j38]Jean-Eric Pin, Pedro V. Silva:
On Profinite Uniform Structures Defined by Varieties of Finite Monoids. Int. J. Algebra Comput. 21(1-2): 295-314 (2011) - 2010
- [j37]Marats Golovkins, Jean-Eric Pin:
Varieties Generated by Certain Models of Reversible Finite Automata. Chic. J. Theor. Comput. Sci. 2010 (2010) - [j36]Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo:
The expressive power of the shuffle product. Inf. Comput. 208(11): 1258-1272 (2010) - 2009
- [j35]Olivier Carton, Jean-Éric Pin, Xaro Soler-Escrivà:
Languages Recognized by Finite Supersoluble Groups. J. Autom. Lang. Comb. 14(2): 149-161 (2009) - 2006
- [j34]Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin:
Operations preserving regular languages. Theor. Comput. Sci. 354(3): 405-420 (2006) - [j33]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
- [j32]Jean-Eric Pin:
Expressive power of existential first-order sentences of Bu"chi's sequential calculus. Discret. Math. 291(1-3): 155-174 (2005) - [j31]Jean-Eric Pin, Howard Straubing:
Some results on C-varieties. RAIRO Theor. Informatics Appl. 39(1): 239-262 (2005) - [j30]Jean-Eric Pin, Pedro V. Silva:
A topological approach to transductions. Theor. Comput. Sci. 340(1): 443-456 (2005) - 2004
- [j29]Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov:
Words Guaranteeing Minimum Image. Int. J. Found. Comput. Sci. 15(2): 259-276 (2004) - [j28]Antonio Cano Gómez, Jean-Eric Pin:
Shuffle on positive varieties of languages. Theor. Comput. Sci. 312(2-3): 433-461 (2004) - 2003
- [j27]Jean-Eric Pin:
Algebraic tools for the concatenation product. Theor. Comput. Sci. 292(1): 317-342 (2003) - [j26]Stéphane Gaubert, Jean Jacques Loiseau, Jean Mairesse, Maurice Nivat, Jean-Eric Pin:
Foreword. Theor. Comput. Sci. 293(1): 1-2 (2003) - 2001
- [j25]Jean-Eric Pin, Pascal Weil:
A conjecture on the concatenation product. RAIRO Theor. Informatics Appl. 35(6): 597-618 (2001) - 1999
- [j24]Jean-Éric Pin:
Marcel-Paul Schützenberger (1920-1996). Int. J. Algebra Comput. 9(3-4): 227-240 (1999) - [j23]Jean-Eric Pin, Pascal Weil:
Uniformities on Free Semigroups. Int. J. Algebra Comput. 9(3-4): 431-454 (1999) - 1997
- [j22]Jean-Eric Pin, Pascal Weil:
Ponynominal Closure and Unambiguous Product. Theory Comput. Syst. 30(4): 383-422 (1997) - 1996
- [j21]Jean-Eric Pin:
Logic, Semigroups and Automata on Words. Ann. Math. Artif. Intell. 16: 343-384 (1996) - [j20]Jean Berstel, Jean-Eric Pin:
Local Languages and the Berry-Sethi Algorithm. Theor. Comput. Sci. 155(2): 439-446 (1996) - [j19]Jean-Eric Pin:
Polynomial Closure of Group Languages and Open Sets of the Hall Topology. Theor. Comput. Sci. 169(2): 185-200 (1996) - 1995
- [j18]Jean-Eric Pin:
A Negative Answer to a Question of Wilke on Varieties of \omega-Languages. Inf. Process. Lett. 56(4): 197-200 (1995) - [j17]Irène Guessarian, Jean-Eric Pin:
Linearizing Some Recursive Logic Programs. IEEE Trans. Knowl. Data Eng. 7(1): 137-149 (1995) - 1994
- [j16]Jean-Eric Pin:
Logic on Words. Bull. EATCS 54: 145-165 (1994) - 1993
- [j15]Jean-Eric Pin, Denis Thérien:
The Bideterministic Concatenation Product. Int. J. Algebra Comput. 3(4): 535-556 (1993) - [j14]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
- [j13]Jean-Eric Pin, Howard Straubing, Denis Thérien:
Some Results on the Generalized Star-Height Problem. Inf. Comput. 101(2): 219-250 (1992) - 1991
- [j12]Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil:
Semigroups with Idempotent stabilizers and Applications to Automata Theory. Int. J. Algebra Comput. 1(3): 291-314 (1991) - [j11]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): 411-436 (1991) - [j10]Danièle Beauquier, Jean-Eric Pin:
Languages and Scanners. Theor. Comput. Sci. 84(1): 3-21 (1991) - 1990
- [j9]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
- [j8]Jean-Marc Champarnaud, Jean-Eric Pin:
A maxmin problem on finite automata. Discret. Appl. Math. 23(1): 91-96 (1989) - [j7]Jean Berstel, Maxime Crochemore, Jean-Eric Pin:
Thue-Morse sequence and p-adic topology for the free monoid. Discret. Math. 76(2): 89-94 (1989) - 1986
- [j6]Dominique Perrin, Jean-Eric Pin:
First-Order Logic and Star-Free Sets. J. Comput. Syst. Sci. 32(3): 393-406 (1986) - 1985
- [j5]Jean-Eric Pin, Jacques Sakarovitch:
Une Application de la Representation Matricielle des Transductions. Theor. Comput. Sci. 35: 271-293 (1985) - 1984
- [j4]Jean-Eric Pin:
Hiérarchies de Concaténation. RAIRO Theor. Informatics Appl. 18(1): 23-46 (1984) - 1982
- [j3]Jean-Eric Pin, Imre Simon:
A Note on the Triangle Conjecture. J. Comb. Theory, Ser. A 32(1): 106-109 (1982) - 1978
- [j2]Jean-Eric Pin:
Sur les mots synthronisants dans un automate fini. J. Inf. Process. Cybern. 14(6): 297-303 (1978) - [j1]Jean-Eric Pin:
Sur le Monoide Syntactique de L* Lorsque L est un Langage Fini. Theor. Comput. Sci. 7: 211-215 (1978)
Conference and Workshop Papers
- 2022
- [c52]Jean-Éric Pin:
Shuffle Product of Regular Languages: Results and Open Problems. CAI 2022: 26-39 - 2020
- [c51]Jean-Éric Pin:
How to Prove that a Language Is Regular or Star-Free? LATA 2020: 68-88 - 2019
- [c50]Jean-Éric Pin, Christophe Reutenauer:
A Mahler's Theorem for Word Functions. ICALP 2019: 125:1-125:13 - 2018
- [c49]Mário J. J. Branco, Jean-Éric Pin:
Inequalities for One-Step Products. DLT 2018: 156-168 - 2017
- [c48]Jean-Éric Pin:
Dual Space of a Lattice as the Completion of a Pervin Space - Extended Abstract. RAMiCS 2017: 24-40 - [c47]Jean-Éric Pin:
Open Problems About Regular Languages, 35 Years Later. The Role of Theory in Computer Science 2017: 153-176 - [c46]Jean-Éric Pin:
The Dot-Depth Hierarchy, 45 Years Later. The Role of Theory in Computer Science 2017: 177-202 - [c45]Jean-Éric Pin:
Some Results of Zoltán Ésik on Regular Languages. FCT 2017: 34-37 - 2016
- [c44]Laure Daviaud, Denis Kuperberg, Jean-Éric Pin:
Varieties of Cost Functions. STACS 2016: 30:1-30:14 - 2015
- [c43]Jean-Éric Pin:
Newton's Forward Difference Equation for Functions from Words to Words. CiE 2015: 71-82 - [c42]Henning Basold, Helle Hvid Hansen, Jean-Éric Pin, Jan Rutten:
Newton Series, Coinductively. ICTAC 2015: 91-109 - 2014
- [c41]Mai Gehrke, Andreas Krebs, Jean-Éric Pin:
From Ultrafilters on Words to the Expressive Power of a Fragment of Logic. DCFS 2014: 138-149 - 2013
- [c40]Jean-Éric Pin:
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages. Developments in Language Theory 2013: 31-45 - 2011
- [c39]Jean-Éric Pin:
Equational descriptions of languages. AFL 2011: 50-63 - [c38]Jean-Éric Pin:
Theme and Variations on the Concatenation Product. CAI 2011: 44-64 - 2010
- [c37]Mai Gehrke, Serge Grigorieff, Jean-Eric Pin:
A Topological Approach to Recognition. ICALP (2) 2010: 151-162 - 2009
- [c36]Mário J. J. Branco, Jean-Eric Pin:
Equations Defining the Polynomial Closure of a Lattice of Regular Languages. ICALP (2) 2009: 115-126 - [c35]Jean-Eric Pin:
Profinite Methods in Automata Theory. STACS 2009: 31-50 - 2008
- [c34]Olivier Carton, Dominique Perrin, Jean-Eric Pin:
Automata and semigroups recognizing infinite words. Logic and Automata 2008: 133-168 - [c33]Antonio Cano Gómez, Giovanna Guaiana, Jean-Eric Pin:
When Does Partial Commutative Closure Preserve Regularity? ICALP (2) 2008: 209-220 - [c32]Mai Gehrke, Serge Grigorieff, Jean-Eric Pin:
Duality and Equational Theory of Regular Languages. ICALP (2) 2008: 246-257 - [c31]Antonio Cano Gómez, Jean-Eric Pin:
A Robust Class of Regular Languages. MFCS 2008: 36-51 - [c30]Jean-Eric Pin, Pedro V. Silva:
A Mahler's theorem for functions from words to integers. STACS 2008: 585-596 - 2006
- [c29]Marats Golovkins, Jean-Eric Pin:
Varieties Generated by Certain Models of Reversible Finite Automata. COCOON 2006: 83-93 - [c28]Laura Chaubard, Jean-Eric Pin, Howard Straubing:
First Order Formulas with Modular Predicates. LICS 2006: 211-220 - 2004
- [c27]Jean-Eric Pin:
The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups. LATIN 2004: 5 - 2003
- [c26]Antonio Cano Gómez, Jean-Eric Pin:
On a Conjecture of Schnoebelen. Developments in Language Theory 2003: 35-54 - [c25]Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin:
Operations Preserving Recognizable Languages. FCT 2003: 343-354 - 2000
- [c24]Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov:
Words Guaranteeing Minimal Image. Words, Languages & Combinatorics 2000: 297-310 - 1998
- [c23]Jean-Eric Pin:
Bridges for Concatenation Hierarchies. ICALP 1998: 431-442 - [c22]Jean-Eric Pin:
Positive Varieties and Infinite Words. LATIN 1998: 76-87 - 1996
- [c21]Jean-Eric Pin:
The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus. ICALP 1996: 300-311 - 1995
- [c20]Jean-Eric Pin, Pascal Weil:
Polynomial Closure and Unambiguous Product. ICALP 1995: 348-359 - 1994
- [c19]Jean-Eric Pin:
Polynomial Closure of Group Languages and Open Sets of the Hall Topology. ICALP 1994: 424-435 - 1993
- [c18]Christian Antoine, Bernard Le Goff, Jean-Eric Pin:
A Graphic Language Based on Timing Diagrams. FSTTCS 1993: 306-316 - 1992
- [c17]Jean-Eric Pin:
On Reversible Automata. LATIN 1992: 401-416 - 1991
- [c16]Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil:
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. FSTTCS 1991: 141-151 - 1989
- [c15]Danièle Beauquier, Jean-Eric Pin:
Factors of Words. ICALP 1989: 63-79 - [c14]Jean-Eric Pin, Howard Straubing, Denis Thérien:
New Results on the Generalized Star-Height Problem. STACS 1989: 458-467 - 1988
- [c13]Jean-Eric Pin:
Relational morphisms, transductions and operations on languages. Formal Properties of Finite Automata and Applications 1988: 34-55 - 1987
- [c12]Jean-Eric Pin:
On the Language Accepted by Finite Reversible Automata. ICALP 1987: 237-249 - 1985
- [c11]Stuart W. Margolis, Jean-Eric Pin:
Products of group languages. FCT 1985: 285-299 - [c10]Jean-Eric Pin:
Finite Group Topology and p-Adic Topology for Free Monoids. ICALP 1985: 445-455 - 1984
- [c9]Stuart W. Margolis, Jean-Eric Pin:
Languages and Inverse Semigroups. ICALP 1984: 337-346 - [c8]Jean-Eric Pin:
Star free omega-languages and first order logic. Automata on Infinite Words 1984: 56-67 - 1983
- [c7]Jean-Eric Pin:
Arbres et Hierarchies de Concatenation. ICALP 1983: 617-628 - [c6]Jean-Eric Pin, Jacques Sakarovitch:
Some operations and transductions that preserve rationality. Theoretical Computer Science 1983: 277-288 - 1981
- [c5]Jean-Eric Pin:
Languages reconnaissables et codage prefixe pur. ICALP 1981: 184-192 - [c4]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
- [c3]Jean-Eric Pin:
Proprietes syntactiques du produit non ambigu. ICALP 1980: 483-499 - 1979
- [c2]Jean-Eric Pin:
Une caractérisation de trois variétés de langages bien connues. Theoretical Computer Science 1979: 233-243 - 1978
- [c1]Jean-Eric Pin:
Sur un Cas Particulier de la Conjecture de Cerny. ICALP 1978: 345-352
Parts in Books or Collections
- 2021
- [p3]Jean-Éric Pin:
Finite automata. Handbook of Automata Theory (I.) 2021: 3-38 - 2001
- [p2]Jean-Eric Pin:
Logic on Words. Current Trends in Theoretical Computer Science 2001: 254-273 - 1997
- [p1]Jean-Eric Pin:
Syntactic Semigroups. Handbook of Formal Languages (1) 1997: 679-746
Editorship
- 2021
- [e5]Jean-Éric Pin:
Handbook of Automata Theory. European Mathematical Society Publishing House, Zürich, Switzerland 2021, ISBN 978-3-98547-006-8 [contents] - 2019
- [e4]Miroslav Ciric, Manfred Droste, Jean-Éric Pin:
Algebraic Informatics - 8th International Conference, CAI 2019, Niš, Serbia, June 30 - July 4, 2019, Proceedings. Lecture Notes in Computer Science 11545, Springer 2019, ISBN 978-3-030-21362-6 [contents] - 2014
- [e3]Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin:
Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings. Lecture Notes in Computer Science 8476, Springer 2014, ISBN 978-3-319-06685-1 [contents] - 2010
- [e2]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010. Dagstuhl Seminar Proceedings 10501, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - 1989
- [e1]Jean-Eric Pin:
Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings. Lecture Notes in Computer Science 386, Springer 1989, ISBN 3-540-51631-X [contents]
Informal and Other Publications
- 2017
- [i5]Olivier Carton, Dominique Perrin, Jean-Éric Pin:
A survey on difference hierarchies of regular languages. CoRR abs/1702.08023 (2017) - [i4]Jorge Almeida, Zoltán Ésik, Jean-Éric Pin:
Commutative positive varieties of languages. CoRR abs/1703.02154 (2017) - 2013
- [i3]Mai Gehrke, Jean-Eric Pin, Victor L. Selivanov, Dieter Spreen:
Duality in Computer Science (Dagstuhl Seminar 13311). Dagstuhl Reports 3(7): 54-73 (2013) - 2010
- [i2]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 - [i1]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
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-11-10 23:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
