Logically Defined Subsets of Nk. - Pierre Péladeau (MFCS, 1989)

NC¹: The Automata-Theoretic Viewpoint. - Pierre McKenzie; Pierre Péladeau; Denis Thérien (Comput. Complex., 1991)

On Reverse and General Definite Tree Languages (Extended Abstract). - Pierre Péladeau; Andreas Podelski (ICALP, 1992)

Sur le produit avec compteur modulo un nombre entier. - Pierre Péladeau (RAIRO Theor. Informatics Appl., 1992)

Logically Defined Subsets of N k. - Pierre Péladeau (Theor. Comput. Sci., 1992)

Formulas, Regular Languages and Boolean Circuits. - Pierre Péladeau (Theor. Comput. Sci., 1992)

Finite Moniods: From Word to Circuit Evaluation. - Martin Beaudry; Pierre McKenzie; Pierre Péladeau; Denis Thérien (SIAM J. Comput., 1997)

Finite Semigroup Varieties Defined by Programs. - Pierre Péladeau; Howard Straubing; Denis Thérien (Theor. Comput. Sci., 1997)

Programs over semigroups of dot-depth one. - Alexis Maciel; Pierre Péladeau; Denis Thérien (Theor. Comput. Sci., 2000)

On the Languages Recognized by Nilpotent Groups (a translation of "Sur les Langages Reconnus par des Groupes Nilpotents") - Pierre Péladeau; Denis Thérien (Electron. Colloquium Comput. Complex., 2001)