Algorithm Design and Analysis

1
Algorithm Design and Analysis

• Tae Young Choe
• School of Computer Engineering
• Kumoh National Institute of Tech.

2
Table of Contents

• Automata
• Beginning point of the theory of computation
• Computability
• Whether a problem can be solved by computer or
  not
• Complexity
• How hard is the given computer problem

3
Automata

• Finite automata
• Nondeterminism
• Regular expressions
• Context-free languages
• Pushdown automata

4
Computability Theory

• Turing machine
• Turing-recognizable
• Turing-decidable
• Definition of algorithm
• Church-Turing Thesis
• Decidability
• Reducibility

5
Complexity Theory

• Time Complexity
• Class P and Class NP