dominique perrin
dominique perrin
Professor of Computer Science, Universite Paris Est
Email verificata su univ-paris-est.fr
Titolo
Citata da
Citata da
Anno
Theory of codes
J Berstel, D Perrin
Academic Press, 1985
11641985
Handbook of theoretical computer science: Algorithms and complexity
J Van Leeuwen, J Leeuwen
Elsevier, 1990
1122*1990
Infinite words: automata, semigroups, logic and games
D Perrin, JÉ Pin
Academic Press, 2004
7282004
Finite automata
D Perrin
Formal Models and Semantics, 1-57, 1990
3621990
Codes and automata
J Berstel, D Perrin, C Reutenauer
Cambridge University Press, 2010
3132010
Two-way string-matching
M Crochemore, D Perrin
Journal of the ACM (JACM) 38 (3), 650-674, 1991
2251991
Automates et commutations partielles
R Cori, D Perrin
RAIRO. Informatique théorique 19 (1), 21-32, 1985
1991985
The origins of combinatorics on words
J Berstel, D Perrin
European Journal of Combinatorics 28 (3), 996-1022, 2007
1932007
First-order logic and star-free sets
D Perrin, JE Pin
Journal of Computer and System Sciences 32 (3), 393-406, 1986
1631986
On the expressive power of temporal logic
J Cohen, D Perrin, JE Pin
Journal of computer and System Sciences 46 (3), 271-294, 1993
1111993
Dictionnaires et lexiques. Méthodes et algorithmes
D Revuz
Paris 7, 1991
1091991
Symbolic dynamics and finite automata
MP Béal, D Perrin
Handbook of formal languages, 463-506, 1997
981997
Recent results on automata and infinite words
D Perrin
International Symposium on Mathematical Foundations of Computer Science, 134-148, 1984
871984
Infinite words, volume 141 of Pure and Applied Mathematics
D Perrin, JÉ Pin
Elsevier, 2004
832004
Semigroups and automata on infinite words
D Perrin, JÉ Pin
NATO ASI Series C Mathematical and Physical Sciences-Advanced Study …, 1995
801995
Ensembles reconnaissables de mots biinfinis
M Nivat, D Perrin
Canadian Journal of Mathematics 38 (3), 513-537, 1986
781986
Sur le théorème du défaut
J Berstel, D Perrin, JF Perrot, A Restivo
Journal of Algebra 60 (1), 169-180, 1979
701979
A quadratic upper bound on the size of a synchronizing word in one-cluster automata
MP Béal, MV Berlinkov, D Perrin
International Journal of Foundations of Computer Science 22 (02), 277-288, 2011
692011
A note on the Burrows-Wheeler transformation
M Crochemore, J Désarménien, D Perrin
arXiv preprint cs/0502073, 2005
692005
Words over a partially commutative alphabet
D Perrin
Combinatorial algorithms on words, 329-340, 1985
681985
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20