4 Types and Advantages of Theory of Computation
4 Types and Advantages of Theory of Computation
4 Types and Advantages of Theory of Computation
1. Automata Theory
Automata are machines that accept a string as input and process it through a
finite number of states before reaching the end state. The primary objective for
creating automata theory was to create tools for describing and analysing the
dynamic behaviour of discrete systems.
Finite Automata
Finite Automata, also known as the Finite State Machine, is a simple machine that
is able to recognize patterns. It is an abstract machine with five components or
tuples. It contains a set of states and rules for going from one state to the next, but
it is dependent on the input symbol used. It is essentially an abstract representation
of a digital computer.
Finite automata has two states: Accept State or Reject State.
3. Computability Theory
The statement that a Turing computer cannot solve the halting issue is one of the
most significant conclusions in computability theory because it is an example of
a concrete problem that is both straightforward to define and impossible to solve
with a Turing machine. The halting issue result serves as the foundation for most
of computability theory.