BCA 3RD SEMESTER FLA 2018
WHAT IS AUTOMATA THEORY?
Automata Theory is an area of computer science concerned with the construction of abstract self-propelled computing systems that automatically follow a specified sequence of actions. A Finite Automaton is an automaton having a finite number of states. This lesson explains the essential ideas of Finite Automata, Regular Languages, and Pushdown Automata before moving on to Turing machines and Decidability.
AUTOMATA SIMULATORS
Automata simulators are educational tools for teaching, learning, and researching automata theory. An automata simulator takes an automaton's description as input and then replicates its behaviour for any arbitrary input string. There are several ways to enter the automaton's description. A symbolic language can be used to define an automata, or its specification can be inputted in a predesigned form, or its transition diagram can be generated by clicking and dragging the mouse. Turing's World, JFLAP, VAS, TAGS, and SimStudio are examples of well-known automata simulators.