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