BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Belgium
1 × Denmark
1 × Iceland
1 × Japan
1 × Spain
1 × USA
2 × France
2 × Germany
2 × Greece
2 × Israel
2 × Italy
3 × Hungary
Collaborated with:
A.C.Gómez S.W.Margolis M.Gehrke S.Grigorieff M.J.J.Branco P.Weil D.Beauquier G.Guaiana L.Chaubard H.Straubing M.V.Volkov
Talks about:
languag (8) polynomi (4) topolog (4) regular (4) closur (4) equat (4) descript (2) formula (2) order (2) group (2)

Person: Jean-Éric Pin

DBLP DBLP: Pin:Jean==Eacute=ric

Contributed to:

DLT 20132013
AFL 20112011
CIAA 20112012
ICALP (2) 20102010
ICALP (2) 20092009
ICALP (2) 20082008
LICS 20062006
DLT 20032003
Words, Languages & Combinatorics 20002000
ICALP 19981998
ICALP 19961996
ICALP 19951995
ICALP 19941994
ICALP 19891989
ICALP 19871987
ICALP 19851985
ICALP 19841984
ICALP 19831983
ICALP 19811981
ICALP 19801980
ICALP 19781978

Wrote 22 papers:

DLT-2013-Pin #regular expression
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages (JÉP), pp. 31–45.
AFL-2011-Pin #equation
Equational descriptions of languages (JÉP), pp. 50–63.
AFL-J-2011-Pin12 #equation
Equational Descriptions of Languages (JÉP), pp. 1227–1240.
ICALP-v2-2010-GehrkeGP #approach #recognition
A Topological Approach to Recognition (MG, SG, JÉP), pp. 151–162.
ICALP-v2-2009-BrancoP #equation #polynomial #regular expression
Equations Defining the Polynomial Closure of a Lattice of Regular Languages (MJJB, JÉP), pp. 115–126.
ICALP-B-2008-GehrkeGP #equation #regular expression
Duality and Equational Theory of Regular Languages (MG, SG, JÉP), pp. 246–257.
ICALP-B-2008-GomezGP #commutative #question
When Does Partial Commutative Closure Preserve Regularity? (ACG, GG, JÉP), pp. 209–220.
LICS-2006-ChaubardPS #composition #first-order
First Order Formulas with Modular Predicates (LC, JÉP, HS), pp. 211–220.
DLT-2003-GomezP #on the
On a Conjecture of Schnoebelen (ACG, JÉP), pp. 35–54.
WLC-2000-MargolisPV #image #word
Words Guaranteeing Minimal Image (SWM, JÉP, MVV), pp. 297–310.
Bridges for Concatenation Hierarchies (JÉP), pp. 431–442.
ICALP-1996-Pin #automaton #calculus #first-order #power of
The Expressive Power of Existential First Order Sentences of Büchi’s Sequential Calculus (JÉP), pp. 300–311.
ICALP-1995-PinW #ambiguity #polynomial
Polynomial Closure and Unambiguous Product (JÉP, PW), pp. 348–359.
ICALP-1994-Pin #polynomial #set
Polynomial Closure of Group Languages and Open Sets of the Hall Topology (JÉP), pp. 424–435.
ICALP-1989-BeauquierP #word
Factors of Words (DB, JÉP), pp. 63–79.
ICALP-1987-Pin #automaton #finite #on the
On the Language Accepted by Finite Reversible Automata (JÉP), pp. 237–249.
ICALP-1985-Pin #finite #for free #monad
Finite Group Topology and p-Adic Topology for Free Monoids (JÉP), pp. 445–455.
Languages and Inverse Semigroups (SWM, JÉP), pp. 337–346.
ICALP-1983-Pin #french
Arbres et Hierarchies de Concatenation (JÉP), pp. 617–628.
ICALP-1981-Pin #french
Languages reconnaissables et codage prefixe pur (JÉP), pp. 184–192.
ICALP-1980-Pin #french
Proprietes syntactiques du produit non ambigu (JÉP), pp. 483–499.
ICALP-1978-Pin #french
Sur un Cas Particulier de la Conjecture de Cerny (JÉP), pp. 345–352.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.