This class for final year BCA students who require coaching in theory of computation subject. 
topics which I will be covering will be finite automata,dfa ,nfa and epsilon nfa.Finite  automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input depending on whether the pattern defined by the FA occurs in the input.NFA stands for “Non-Deterministic Automata,” whereas DFA stands for “Deterministic Automata.” NFA allows for multiple possible following states based on the current input. In contrast, DFA has a unique transition from each state to every input.After every topic we shall have doubts session to clear doubts and students shall have one book and pen to make a note of the important topics and most repeated types of questions asked in exam.

please attend the session and accordingly provide me the review of the same .

thank you