68Qxx Theory of computing
- 68Q05 Models of computation (abstract processors, Turing machines, etc.), See also {03D10}
- 68Q10 Modes of computation (concurrent, parallel, nondeterministic, etc.), See also {68Q90}
- 68Q15 Complexity classes, See also {03D15}
- 68Q20 Nonnumerical algorithms, {For numerical algorithms, See
65-XX; for combinatorics and graph theory, See 68Rxx}
- 68Q22 Parallel and distributed algorithms, {For numerical algorithms, See 65Y05, 65Y10}
- 68Q25 Analysis of algorithms and problem complexity
- 68Q30 Algorithmic information theory (Kolmogorov complexity, etc.)
- 68Q35 VLSI algorithms
- 68Q40 Symbolic computation, algebraic computation, See Also {11Yxx, 12Y05, 13Pxx, 14Qxx, 16-08, 17-08}
- 68Q42 Rewriting systems
- 68Q45 Formal languages, See also {03D05, 20M35, 94A45}
- 68Q50 Grammars, See also {03D05}
- 68Q52 Parsing, See also {68N20}
- 68Q55 Semantics, See also {03B70, 06B35}
- 68Q60 Specification and verification of programs, See Also {
03B70}
- 68Q65 Abstract data types; algebraic specification
- 68Q68 Automata theory, general, See also {03D05}
- 68Q70 Algebraic theory of automata, See also {18B20, 20M35}
- 68Q75 Stochastic and nondeterministic automata
- 68Q80 Tessellation automata, iterative arrays, cellular structures
- 68Q90 Transition nets
- 68Q99 None of the above but in this section
--> Top level of Index
--> Top level of this Section