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 × Denmark
1 × Germany
1 × Spain
2 × Italy
2 × USA
2 × United Kingdom
Collaborated with:
M.Béal F.Dolce O.Carton P.E.Schupp M.Nivat M.V.Berlinkov F.Bassino
Talks about:
automata (3) synchron (2) quadrat (2) cluster (2) ration (2) upper (2) bound (2) word (2) size (2) set (2)

Person: Dominique Perrin

DBLP DBLP: Perrin:Dominique

Contributed to:

DLT 20152015
DLT 20092009
DLT 20092011
ICALP 19971997
ICALP 19891989
LICS 19861986
ICALP 19831983
ICALP 19821982
STOC 19821982
ICALP 19761976

Wrote 11 papers:

DLT-2015-DolceP #set
Enumeration Formulæ in Neutral Sets (FD, DP), pp. 215–227.
DLT-2009-BealP #automaton #bound #clustering #polynomial #word
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, DP), pp. 81–90.
DLT-J-2009-BealBP11 #automaton #bound #clustering #polynomial #word
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, MVB, DP), pp. 277–288.
ICALP-1997-BassinoBP #sequence
Enumerative Sequences of Leaves in Rational Trees (FB, MPB, DP), pp. 76–86.
ICALP-1997-CartonP #set
The Wadge-Wagner Hierarchy of ω-Rational Sets (OC, DP), pp. 17–35.
Partial Commutations (DP), pp. 637–651.
LICS-1986-PerrinS #automaton #decidability #equivalence #integer #monad
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
ICALP-1983-Perrin #french
Varietes de Semigroupes et Mots Infinis (DP), pp. 610–616.
Completing Biprefix Codes (DP), pp. 397–406.
Ensembles Reconnaissables de Mots Biinfinis (MN, DP), pp. 47–59.
ICALP-1976-Perrin #french
Sur la longeur moyenne des codes préfixes (DP), pp. 45–51.

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.