The following pages link to Denis Thérien (Q685707):
Displaying 50 items.
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Nesting until and since in linear temporal logic (Q705066) (← links)
- A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages (Q795178) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- Dichotomies in the complexity of solving systems of equations over finite semigroups (Q870451) (← links)
- On the equation \(x^ t=x^{t+q}\) in categories (Q1100548) (← links)
- Locally trivial categories and unambiguous concatenation (Q1103056) (← links)
- Partially ordered finite monoids and a theorem of I. Simon (Q1111705) (← links)
- Programs over aperiodic monoids (Q1122664) (← links)
- Classification of finite monoids: the language approach (Q1157412) (← links)
- (Q1172155) (redirect page) (← links)
- Recognizable languages and congruences (Q1172156) (← links)
- Two-sided wreath product of categories (Q1181464) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- Some results on the generalized star-height problem (Q1207944) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and'' in sublinear size (Q1346618) (← links)
- Finite semigroup varieties defined by programs (Q1390876) (← links)
- An algebraic approach to data languages and timed languages (Q1398367) (← links)
- Regular languages defined by generalized first-order formulas with a bounded number of bound variables (Q1405799) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- Programs over semigroups of dot-depth one (Q1575738) (← links)
- Complete classifications for the communication complexity of regular languages (Q1771314) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Logspace and logtime leaf languages (Q1817219) (← links)
- Sur les monoides dont tous les groupes sont resolubles (Q1838586) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- Regular languages defined with generalized quantifiers (Q1892890) (← links)
- Robert Knast (1940-1994) (Q1910637) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Graph congruences and wreath products (Q2266130) (← links)
- Algebraic results on quantum automata (Q2432533) (← links)
- Learning expressions and programs over monoids (Q2490112) (← links)
- A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits (Q2509033) (← links)
- The many faces of a translation (Q2581761) (← links)
- (Q2754205) (← links)
- (Q2762498) (← links)
- (Q2762512) (← links)
- (Q2762532) (← links)
- Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy (Q2784480) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- (Q3044318) (← links)
- (Q3086935) (← links)
- (Q3123635) (← links)
- (Q3205447) (← links)
- (Q3396575) (← links)
- Tractable Clones of Polynomials over Semigroups (Q3524174) (← links)
- WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY (Q3561125) (← links)
- Bounded-depth circuits (Q3581426) (← links)
