Formal Language and Automata Theory

No Reviews Yet

Course type: Online Instructor led Course

Platform: Skype

Course ID: 42723

Course type: Online Instructor led Course

Platform: Skype

Students Interested 0 (Seats Left 0)

No Reviews Yet

Date and Time

Not decided yet.

Charan

M.Tech

About Charan

Hands on experience on giving Coaching for GATE and Guest Lectures.
No reviews currently Be the First to Review

About the Course

UNIT I : 


Fundamentals : Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model, acceptance of strings, and languages, deterministic finite automaton and non deterministic finite automaton, transition diagrams and Language recognizers. 


Finite Automata : NFA with Ã? transitions - Significance, acceptance of languages. Conversions and Equivalence : Equivalence between NFA with and without transitions, NFA to DFA conversion, minimisation of FSM, equivalence between two FSMâ??s, Finite Automata with output- Moore and Melay machines. 


UNIT II : 


Regular Languages : Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regular expressions, Conversion of Finite Automata to Regular expressions. Pumping lemma of regular sets, closure properties of regular sets (proofs not required). 


Grammar Formalism : Regular grammars-right linear and left linear grammars, equivalence between regular linear grammar and FA, inter conversion, Context free grammar, derivation trees, sentential forms. Right most and leftmost derivation of strings. 


UNIT III : 


Context Free Grammars : Ambiguity in context free grammars. Minimisation of Context Free Grammars. Chomsky normal form, Greiback normal form, Pumping Lemma for Context Free Languages. Enumeration of properties of CFL (proofs omitted). 


Push Down Automata : Push down automata, definition, model, acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence. Equivalence of CFL and PDA, interconversion. (Proofs not required). Introduction to DCFL and DPDA. 


UNIT IV : 


Turing Machine : Turing Machine, definition, model, design of TM, Computable functions, recursively enumerable languages. Churchâ??s hypothesis, counter machine, types of Turing machines (proofs not required). linear bounded automata and context sensitive language.


UNIT V :  


Computability Theory : Chomsky hierarchy of languages, linear bounded automata and context sensitive language, LR(0) grammar, decidability of, problems, Universal Turing Machine, undecidability of posts. Correspondence problem, Turing reducibility, Definition of P and NP problems, NP complete and NP hard problems. 

Reviews

No reviews currently Be the First to Review

Discussions

Students Interested 0 (Seats Left 0)

Post your requirement and let us connect you with best possible matches for BTech Tuition Post your requirement now

Enquire

Submit your enquiry for Formal Language and Automata Theory

Please enter valid question or comment

Please enter your name.

Please enter valid Phone Number

Please enter the Pin Code.

By submitting, you agree to our Terms of use and Privacy Policy

Connect With Mounika

You have reached a limit!

We only allow 20 Tutor contacts under a category. Please send us an email at support@urbanpro.com for contacting more Tutors.

You Already have an UrbanPro Account

Please Login to continue

Please Enter valid Email or Phone Number

Please Enter your Password

Please enter the OTP sent to your registered mobile number.

Please Enter valid Password or OTP

Forgot Password? Resend OTP OTP Sent

Sorry, we were not able to find a user with that username and password.

We have sent you an OTP to your register email address and registered number. Please enter OTP as Password to continue

Further Information Received

Thank you for providing more information about your requirement. You will hear back soon from the trainer

UrbanPro.com is India's largest network of most trusted tutors and institutes. Over 25 lakh students rely on UrbanPro.com, to fulfill their learning requirements across 1,000+ categories. Using UrbanPro.com, parents, and students can compare multiple Tutors and Institutes and choose the one that best suits their requirements. More than 6.5 lakh verified Tutors and Institutes are helping millions of students every day and growing their tutoring business on UrbanPro.com. Whether you are looking for a tutor to learn mathematics, a German language trainer to brush up your German language skills or an institute to upgrade your IT skills, we have got the best selection of Tutors and Training Institutes for you. Read more