Denis Therien
Denis Therien
Unknown affiliation
Verified email at elementai.com
TitleCited byYear
Finite monoids and the fine structure of NC1
DAM Barrington, D Therien
Journal of the ACM (JACM) 35 (4), 941-952, 1988
2471988
Over words, two variables are as powerful as one quantifier alternation
D Thérien, T Wilke
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
1381998
Regular languages in NC1
DAM Barrington, K Compton, H Straubing, D Thérien
Journal of Computer and System Sciences 44 (3), 478-499, 1992
1301992
Non-uniform automata over groups
DAM Barrington, H Straubing, D Thérien
Information and Computation 89 (2), 109-132, 1990
1271990
Classification of finite monoids: the language approach
D Thérien
Theoretical Computer Science 14 (2), 195-208, 1981
1241981
Graph congruences and wreath products
D Thérien, A Weiss
Journal of Pure and Applied Algebra 36, 205-215, 1985
1081985
NondeterministicNC1Computation
H Caussinus, P McKenzie, D Thérien, H Vollmer
Journal of Computer and System Sciences 57 (2), 200-212, 1998
1061998
Diamonds are forever: The variety DA
P Tesson, D Thérien
Semigroups, algorithms, automata and languages, 475-499, 2002
1042002
Logics for context-free languages
C Lautemann, T Schwentick, D Thérien
International Workshop on Computer Science Logic, 205-216, 1994
871994
An algebraic approach to data languages and timed languages
P Bouyer, A Petit, D Thérien
Information and Computation 182 (2), 137-162, 2003
852003
Locally trivial categories and unambiguous concatenation
JÉ Pin, H Straubing, D Thérien
Journal of Pure and Applied Algebra 52 (3), 297-311, 1988
811988
Partially ordered finite monoids and a theorem of I. Simon
H Straubing, D Thérien
Journal of Algebra 119 (2), 393-399, 1988
721988
Algebraic results on quantum automata
A Ambainis, M Beaudry, M Golovkins, A Kikusts, M Mercer, D Thérien
Theory of Computing Systems 39 (1), 165-188, 2006
702006
Logspace and logtime leaf languages
B Jenner, P McKenzie, D Thérien
Information and Computation 129 (1), 21-33, 1996
691996
Partially-ordered two-way automata: A new characterization of DA
T Schwentick, D Thérien, H Vollmer
International Conference on Developments in Language Theory, 239-250, 2001
672001
Regular languages defined with generalized quantifiers
H Straubing, D Thérien, W Thomas
Information and computation 118 (2), 289-301, 1995
661995
Temporal logic and semidirect products: An effective characterization of the until hierarchy
D Thérien, T Wilke
Proceedings of 37th Conference on Foundations of Computer Science, 256-263, 1996
56*1996
NC1: The automata-theoretic viewpoint
P McKenzie, P Péladeau, D Thérien
Computational Complexity 1 (4), 330-359, 1991
521991
Regular languages defined with generalized quantifiers
H Straubing, D Thérien, W Thomas
International Colloquium on Automata, Languages, and Programming, 561-575, 1988
521988
Subword counting and nilpotent groups
D Thérien
Combinatorics on words, 297-305, 1983
441983
The system can't perform the operation now. Try again later.
Articles 1–20