COMPILER DESIGN

Detailed explanation-1: -In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory, computability theory and computational complexity theory.

Detailed explanation-2: -The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: “What are the fundamental capabilities and limitations of computers?".

Detailed explanation-3: -Computability theory, discussed in Part 1, is the theory of computation obtained when limitations of space and time are deliberately ignored. In automata theory, which we study in this chapter, computation is studied in a context in which bounds on space and time are entirely relevant.

Detailed explanation-4: -Theory of automata is a theoretical branch of computer science and mathematical. It is the study of abstract machines and the computation problems that can be solved using these machines. The abstract machine is called the automata.