Download Automata Theory Lectures and Tutorials

What is Theory of Automata ?

In theoretical computer science, we can define automata theory  as  it  is the study of abstract machines and the computational problems that can be solved using these abstract machines. These abstract machines are known as automata.




    Topics List

•       Kleene Star Closure
•     Define and explain PLUS Operation (+)
•     Recursive definition of languages
•     introduction to Regular Expression
•     Regular Languages
•     what are Generalized Transition Graphs?
•     what is Non determinism ?
•     State and explain Kleene’s Theorem
•     Proof Kleene’s Theorem
•     what ae bypass and state elimination how many methods it have?
•     Union of two FAs):
•     Concatenation of two FAs)
•     Closure of an FA
•     Non deterministic Finite Automaton (NFA)
•     how Converting an FA to an equivalent NFA?
•     Application of an NFA
•     NFA with Null String
•     NFA to FA (tree methods)
•     NFA and Kleene’s Theorem (methods)?
•     how explain NFA corresponding to the Closure of an FA?
•     how many Applications of Incrementing and Complementing machines?
•     Complement of a language?
•     how FA corresponding to intersection of two regular languages?
•     Non regular languages?
•     Pumping Lemma?
•     Myhill Nerode theorem?
•     Quotient of a language into another?
•     what is Pseudo theorem ,where it is used?
•     complete explanation of Decidability?
•     what are Context Free Grammar (CFG)withe brife explanation ?
•     how many types of CFG terminologies?
•     what are Context Free Language (CFL)?
•     what are  tree Trees complete explanation with examples?
•     state defination of Syntax tree?
•     what is Polish Notation where it is used ?
•     intro to Ambiguous CFG?
•     how many types of Total language tree
•     what isRegular Grammar?
•     what is TG for Regular Grammar?
•     what and how use Null Production
•     what and how use Nullable Production?
•     what and how useUnit production?
•     what and how use Chomsky Normal Form?
•     what and how use Chomsky Normal Form (CNF)?
•     define and explain PUSHDOWN STACK or PUSHDOWN STORE?
•     what is Non deterministic PDA?
•     how thePDA corresponding to CFG
•     introduction to Non-Context-Free language
•     what is Pumping lemma for CFLs?
•     what is Decidability?
•     what is The CYK algorithm?
•     how use Parsing Techniques?
•     what is Turing machine complete explanation with examples?