Computational Theory
What is Computational Theory?
Theory of Computation or Automata Theory is the fundamental of computer science & engineering.
Its main focus is to deeply understand the computational processes using mathematical models, tools and techniques.
Automata Theory-
Automata concept is originated from the word “Automaton” which is closely connected to “Automation”
It is a part of computer science and mathematical models. Automata theory is the study of abstract machines and the computation problems which are used to solve computation difficulties.
Automata Theory is established its roots during the 20th Century, as mathematicians began developing — both theoretically and literally — machines which imitated certain features of man, completing calculations more quickly and reliably.
Automatons are the abstract models of machines that perform computations on an input by moving through a series of states or configurations. At each state of the computation, a transition function determines the next configuration on the basis of a finite portion of the present configuration. As a result, once the computation reaches an accepting configuration, it accepts that input.
By using automata, computer scientists are able to understand how machines compute functions and solve problems and more importantly, what it means for a function to be defined as computable or for a question to be described as decidable.
The most capable and useful automata is the Turing machine.
Families of automaton:
- Finite-state machine
2. Pushdown automata
3. Linear-bounded automata
4. Turing machine
Want to know more about MIT College of Railway Engineering and Research Barshi, MH.
Apply now @ https://bit.ly/2K2tT00
#MITCORER #MITCORERBarshi #TransformIndia #MIT #BTech #RailwayEngineering #railways
