Denis Therien
Affiliations: | McGill University, Montreal, QC, Canada |
Area:
Computer ScienceGoogle:
"Denis Therien"Parents
Sign in to add mentor| Janusz A. (John) Brzozowski | grad student | 1980 | University of Waterloo (E-Tree) | |
| (Classification of Regular Languages by Congruences.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Chattopadhyay A, Gavaldà R, Hansen KA, et al. (2014) Learning Read-Constant Polynomials of Constant Degree Modulo Composites Theory of Computing Systems. 55: 404-420 |
| Straubing H, Tesson P, ThÉrien D. (2010) Weakly iterated block products and applications to logic and complexity International Journal of Algebra and Computation. 20: 319-341 |
| Tesson P, Thérien D. (2007) Logic Meets Algebra: the Case of Regular Languages Logical Methods in Computer Science. 3 |
| Klíma O, Tesson P, Thérien D. (2007) Dichotomies in the complexity of solving systems of equations over finite semigroups Theory of Computing Systems. 40: 263-297 |
| McKenzie P, Schwentick T, Thérien D, et al. (2006) The many faces of a translation Journal of Computer and System Sciences. 72: 163-179 |
| Gavaldà R, Tesson P, Thérien D. (2006) Learning expressions and programs over monoids Information and Computation. 204: 177-209 |
| Ambainis A, Beaudry M, Golovkins M, et al. (2006) Algebraic results on quantum automata Theory of Computing Systems. 39: 165-188 |
| Borchert B, Lange KJ, Stephan F, et al. (2005) The dot-depth and the polynomial hierarchies correspond on the delta levels International Journal of Foundations of Computer Science. 16: 625-644 |
| Barrington DAM, Immerman N, Lautemann C, et al. (2005) First-order expressibility of languages with neutral letters or: The Crane Beach conjecture Journal of Computer and System Sciences. 70: 101-127 |
| Tesson P, Thérien D. (2005) Complete classifications for the communication complexity of regular languages Theory of Computing Systems. 38: 135-159 |