Theory of computation: model of computation and Deterministic Finite Automaton
When we talk about Theory of Computation, we talk about the branch of Computer Science that deals with the set of problems that can be solved using an algorithm, providing a model of computation.
When we have a problem, the Theory of Computation permits us to answer questions like:
- Could be the problem solved algorithmically?
- If the answer of the above question is yes, how efficiently can be solved?
- Could exists a precise…