Denis Thérien

From MaRDI portal
Person:685707

Available identifiers

zbMath Open therien.denisMaRDI QIDQ685707

List of research outcomes

PublicationDate of PublicationType
Testing membership: Beyond permutation groups2022-08-16Paper
New results on the generalized star-height problem2022-08-16Paper
Finite loops recognize exactly the regular open languages2018-07-04Paper
Learning read-constant polynomials of constant degree modulo composites2015-02-05Paper
The Power of Diversity2011-07-29Paper
Learning Read-Constant Polynomials of Constant Degree Modulo Composites2011-06-17Paper
https://portal.mardi4nfdi.de/entity/Q30869352011-03-30Paper
Bounded-depth circuits2010-08-16Paper
WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY2010-05-25Paper
An Algebraic Perspective on Boolean Function Learning2009-12-01Paper
https://portal.mardi4nfdi.de/entity/Q33965752009-09-19Paper
An Algebraic Point of View on the Crane Beach Property2009-03-12Paper
Tractable Clones of Polynomials over Semigroups2008-09-09Paper
Logic Meets Algebra: the Case of Regular Languages2007-10-11Paper
STACS 20042007-10-01Paper
Languages with Bounded Multiparty Communication Complexity2007-09-03Paper
Dichotomies in the complexity of solving systems of equations over finite semigroups2007-03-12Paper
Algebraic results on quantum automata2006-10-25Paper
A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits2006-10-16Paper
Learning expressions and programs over monoids2006-04-28Paper
The many faces of a translation2006-01-10Paper
Automata, Languages and Programming2006-01-10Paper
Automata, Languages and Programming2006-01-10Paper
Developments in Language Theory2005-12-22Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS2005-08-03Paper
Imre Simon: an exceptional graduate student2005-06-07Paper
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture2005-05-12Paper
Complete classifications for the communication complexity of regular languages2005-04-19Paper
MONOIDS AND COMPUTATIONS2005-03-18Paper
Nesting until and since in linear temporal logic2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48143402004-09-07Paper
https://portal.mardi4nfdi.de/entity/Q30443182004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47368622004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47379112004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44748402004-07-21Paper
https://portal.mardi4nfdi.de/entity/Q44492352004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44074412003-11-30Paper
https://portal.mardi4nfdi.de/entity/Q45295372003-09-18Paper
Regular languages defined by generalized first-order formulas with a bounded number of bound variables2003-08-26Paper
https://portal.mardi4nfdi.de/entity/Q44186372003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44186612003-08-11Paper
An algebraic approach to data languages and timed languages2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q48078332003-05-26Paper
https://portal.mardi4nfdi.de/entity/Q47918392003-02-03Paper
Efficient threshold circuits for power series2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47791712002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45363532002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q45425412002-09-17Paper
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27624982002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27625122002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27625322002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27542052001-11-11Paper
Programs over semigroups of dot-depth one2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49422762000-03-21Paper
Circuits and expressions with nonassociative gates2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42190221999-03-30Paper
Threshold circuits of small majority-depth1999-01-06Paper
Finite semigroup varieties defined by programs1998-07-22Paper
Nondeterministic \(NC^1\) computation1998-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31236351997-10-16Paper
Finite Monoids: From Word to Circuit Evaluation1997-08-03Paper
Logspace and logtime leaf languages1997-02-23Paper
Robert Knast (1940-1994)1996-03-20Paper
Regular languages defined with generalized quantifiers1995-07-10Paper
Circuits constructed with MOD\(_ q\) gates cannot compute ``and in sublinear size1995-04-06Paper
The membership problem in aperiodic transformation monoids1995-01-05Paper
THE BIDETERMINISTIC CONCATENATION PRODUCT1994-04-17Paper
https://portal.mardi4nfdi.de/entity/Q42815571994-03-10Paper
\(NC^ 1\): The automata-theoretic viewpoint1993-10-10Paper
Some results on the generalized star-height problem1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40296101993-03-28Paper
Regular languages in \(NC\)1992-09-27Paper
Two-sided wreath product of categories1992-06-27Paper
Non-uniform automata over groups1990-01-01Paper
Programs over aperiodic monoids1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47321271989-01-01Paper
On the equation \(x^ t=x^{t+q}\) in categories1988-01-01Paper
Locally trivial categories and unambiguous concatenation1988-01-01Paper
Partially ordered finite monoids and a theorem of I. Simon1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37797651988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38068491988-01-01Paper
Catégories et langages de dot-depth un1988-01-01Paper
Finite monoids and the fine structure of NC 11988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37607471987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37733531987-01-01Paper
Varieties of finite categories1986-01-01Paper
Graph congruences and wreath products1985-01-01Paper
A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36893841984-01-01Paper
Sur les monoides dont tous les groupes sont resolubles1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36893831983-01-01Paper
Classification of finite monoids: the language approach1981-01-01Paper
Recognizable languages and congruences1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32054471979-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Denis Thérien