Need for Automata Theory

UNIT: I: Automata and Regular Expressions

Syllabus

Need for automata theory - Introduction to formal proof-Finite Automata (FA) - Deterministic Finite Automata (DFA) - Non-deterministic Finite Automata (NFA) - Equivalence between NFA and DFA - Finite Automata with Epsilon transitions - Equivalence of NFA and DFA - Equivalence of NFAs with and without E-moves - Conversion of NFA into DFA - Minimization of DFAS.

Need for Automata Theory

• In automata theory and computability the word computability is for the computation in mathematical modeling. Hence this subject deals with the study of various mathematical models that are required for some computations.

• In this study, various models, their behavior, properties, kind of languages they accept, their limitations are studied.

• The theory of computation provides a set of abstract structures that are useful for solving certain classes of problems. These abstract structures can be implemented on available hardware or software platform.

• Using these abstract structures the required design efforts can be determined for the actual model.

• Theory of computation plays an important role in compiler design.

• In switching theory, design and analysis of digital circuits automata theory can be applied.

• Many times to prove the correctness of the program, automata theory is used.