Pierre Péladeau

According to our database, Pierre Péladeau authored at least 10 papers between 1989 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2001

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

2000

Programs over semigroups of dot-depth one.

Alexis Maciel, Pierre Péladeau, Denis Thérien

Theor. Comput. Sci., 2000

1997

Finite Semigroup Varieties Defined by Programs.

Pierre Péladeau, Howard Straubing, Denis Thérien

Theor. Comput. Sci., 1997

Finite Moniods: From Word to Circuit Evaluation.

Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien

SIAM J. Comput., 1997

1992

Formulas, Regular Languages and Boolean Circuits.

Pierre Péladeau

Theor. Comput. Sci., 1992

Logically Defined Subsets of N k.

Pierre Péladeau

Theor. Comput. Sci., 1992

Sur le produit avec compteur modulo un nombre entier.

Pierre Péladeau

RAIRO Theor. Informatics Appl., 1992

On Reverse and General Definite Tree Languages (Extended Abstract).

Pierre Péladeau, Andreas Podelski

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

NC¹: The Automata-Theoretic Viewpoint.

Pierre McKenzie, Pierre Péladeau, Denis Thérien

Comput. Complex., 1991

1989

Logically Defined Subsets of N^k.

Pierre Péladeau

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989