TOC Notes_________________IIT-BHU [Hand Made Notes] Free Download

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Click/Like This Post On FaceBook-

Note: This Note is Prepared By one of The Gems Of IIT-BHU For You Guys...!!

Please Download And Share In Your Frnds..!!

____________TOC Notes(Click here)_______________

Stay Update For EveryNotes Of GATE

In theoretical computer science and mathematics, the theory of computation is the branch that deals with 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

Automata theory is the study of abstract machines (or more appropriately, abstract 'mathematical' machines or systems) and the computational problems that can be solved using these machines. These abstract machines are called automata. Automata comes from the Greek word (Αυτόματα) which means that something is doing something by itself. Automata theory is also closely related to formal language theory, as the automata are often classified by the class of formal languages they are able to recognize. An automaton can be a finite representation of a formal language that may be an infinite set.

Don't Forgt To Hit Like