Computer Science
Automaton
26%
Axiomatization
33%
Case Study
40%
Data Structure
32%
Decision Procedure
15%
Equivalence Class
15%
Finite Automata
35%
Formalization
59%
high-order logic
100%
Inference Rule
31%
Infinite Sequence
16%
lambda-calculus
17%
Model Checking
33%
Operational Semantics
22%
Order Unification
21%
Ordered Resolution
18%
Parallel Composition
18%
Process Algebra
31%
Refutational Completeness
22%
Syntactics
15%
Term Rewriting Systems
15%
Theorem Prover
75%
Theorem Proving
19%
Transition System
22%
Turing Machine
26%
Mathematics
Algebraic Number Theory
10%
Calculus
21%
Coincides
8%
Decomposition Method
23%
Dedekind Domain
10%
Formalization
21%
Global Field
10%
Infinite Sequence
18%
Modulo
17%
Morphism
10%
Nonlinear
10%
Partial Order
8%
Polynomial
21%
Preorder
10%
Process Algebra
36%
Rewriting Systems
8%
Superposition
13%
Turing Machine
12%
Unsolvability
9%
Wide Range
9%
Engineering
Control Synthesis
21%
Discrete Event Simulation
9%
Large-Scale Systems
8%
Matrix Structure
13%
Real Life
11%
Road Tunnels
12%
Roadsides
14%
Supervisory Control
37%
Supervisory Controller
39%