| 2001 |
|---|
| 10 | EE | Pierre Péladeau,
Denis Thérien:
On the Languages Recognized by Nilpotent Groups (a translation of "Sur les Langages Reconnus par des Groupes Nilpotents")
Electronic Colloquium on Computational Complexity (ECCC) 8(40): (2001) |
| 2000 |
|---|
| 9 | EE | Alexis Maciel,
Pierre Péladeau,
Denis Thérien:
Programs over semigroups of dot-depth one.
Theor. Comput. Sci. 245(1): 135-148 (2000) |
| 1997 |
|---|
| 8 | | Martin Beaudry,
Pierre McKenzie,
Pierre Péladeau,
Denis Thérien:
Finite Moniods: From Word to Circuit Evaluation.
SIAM J. Comput. 26(1): 138-152 (1997) |
| 7 | EE | Pierre Péladeau,
Howard Straubing,
Denis Thérien:
Finite Semigroup Varieties Defined by Programs.
Theor. Comput. Sci. 180(1-2): 325-339 (1997) |
| 1992 |
|---|
| 6 | | Pierre Péladeau,
Andreas Podelski:
On Reverse and General Definite Tree Languages (Extended Abstract).
ICALP 1992: 150-161 |
| 5 | | Pierre Péladeau:
Sur le produit avec compteur modulo un nombre entier.
ITA 26: 553-564 (1992) |
| 4 | | Pierre Péladeau:
Formulas, Regular Languages and Boolean Circuits.
Theor. Comput. Sci. 101(1): 133-141 (1992) |
| 3 | | Pierre Péladeau:
Logically Defined Subsets of N k.
Theor. Comput. Sci. 93(2): 169-183 (1992) |
| 1991 |
|---|
| 2 | | Pierre McKenzie,
Pierre Péladeau,
Denis Thérien:
NC¹: The Automata-Theoretic Viewpoint.
Computational Complexity 1: 330-359 (1991) |
| 1989 |
|---|
| 1 | | Pierre Péladeau:
Logically Defined Subsets of Nk.
MFCS 1989: 397-407 |
