Pierre Péladeau

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On reverse and general definite tree languages (extended abstract) Automata, Languages and Programming	2019-12-04	Paper
Programs over semigroups of dot-depth one Theoretical Computer Science	2000-08-21	Paper
Finite semigroup varieties defined by programs Theoretical Computer Science	1998-07-22	Paper
Finite Monoids: From Word to Circuit Evaluation SIAM Journal on Computing	1997-08-03	Paper
scientific article; zbMATH DE number 459362 (Why is no real title available?)	1994-09-20	Paper
scientific article; zbMATH DE number 512861 (Why is no real title available?)	1994-04-07	Paper
\(NC^ 1\): The automata-theoretic viewpoint Computational Complexity	1993-10-10	Paper
Sur le produit avec compteur modulo un nombre premier RAIRO - Theoretical Informatics and Applications	1993-04-01	Paper
Formulas, regular languages and Boolean circuits Theoretical Computer Science	1992-09-27	Paper
Logically defined subsets of \(\mathbb{N}{}^ k\) Theoretical Computer Science	1992-06-28	Paper
scientific article; zbMATH DE number 4204325 (Why is no real title available?)	1989-01-01	Paper
scientific article; zbMATH DE number 4041299 (Why is no real title available?)	1988-01-01	Paper

Research outcomes over time

This page was built for person: Pierre Péladeau