17
context-free
× 7 |
2
undecidability
× 2 |
1
binary-trees
|
1
normal-forms-databases
|
16
formal-grammars
× 6 |
2
algorithm-analysis
× 2 |
1
complexity-theory
|
0
compilers
× 3 |
14
formal-languages
× 4 |
2
semi-decidability
|
1
asymptotics
|
0
parsers
× 3 |
9
ambiguity
× 2 |
2
computability
|
1
nondeterminism
|
0
lr-k
× 2 |
3
algorithms
× 4 |
1
time-complexity
× 3 |
1
pushdown-automata
|
0
pumping-lemma
|
3
turing-machines
× 3 |
1
trees
× 2 |
1
dbms
|
0
halting-problem
|
3
graph-traversal
|
1
binary-search-trees
× 2 |
1
thomas-write-rule
|
0
reductions
|
3
minimum-spanning-tree
|
1
topology
|
1
database-theory
|
0
closure-properties
|
Vimal Patel
