53
automata-theory
× 12 |
11
monoid
|
2
pl.programming-languages
|
0
polynomial-time
|
52
fl.formal-languages
× 16 |
9
ds.algorithms
× 4 |
2
regular-expressions
|
0
graph-theory
|
50
reference-request
× 9 |
8
open-problem
× 2 |
0
big-list
× 5 |
0
circuit-complexity
|
36
computability
× 5 |
8
hard-instances
× 2 |
0
soft-question
× 3 |
0
space-time-tradeoff
|
33
context-free
× 6 |
8
nondeterminism
× 2 |
0
descriptive-complexity
× 3 |
0
na.numerical-analysis
|
19
regular-language
× 5 |
8
dfa
|
0
np-hardness
× 3 |
0
markov-chains
|
14
lo.logic
× 3 |
7
grammars
|
0
probabilistic-automata
× 2 |
0
communication-complexity
|
14
finite-model-theory
|
5
decidability
|
0
co.combinatorics
|
0
reductions
|
12
cc.complexity-theory
× 7 |
5
undecidability
|
0
space-bounded
|
0
stochastic-process
|
12
complexity-classes
|
3
counter-automata
|
0
factoring
|
0
homomorphism
|
11
algebra
|
2
terminology
|
0
universal-turing-machines
|
Michaël Cadilhac
