Signup as a Tutor

As a tutor you can connect with more than a million students and grow your network.

# Automata theory : Theory of Computer Science

No Reviews Yet

Course type: Online Instructor led Course

Platform: Skype

Course ID: 20745

Course type: Online Instructor led Course

Platform: Skype

Students Interested 0 (Seats Left 0)

No Reviews Yet

Details study of Automata theory or also knows as Theory of computer science.

## Topics Covered

Lecture 1: Introduction to Deterministic Finite Automata (DFA)
Text
Lecture 2: Minimization of Finite Automata
09:39
Lecture 3: Introduction to Non-deterministic finite automata (NFA)
Text
Lecture 4: Converting NFA to DFA
05:27
Lecture 5: Mealy machine to Moore Machine
11 slides
Lecture 6: Moore machine to Mealy Machine
4 slides
Lecture 7: Equivalence of two Finite Automata : DFA comparision
06:59
Lecture 8: Automata : Introduction to Grammar
09:32
Lecture 9: Regular Expression to NDFA
7 pages
Lecture 10: Myhill-Nerode Minimization : DFA minimization
09:19
Lecture 11: Limitations of FSM
2 pages
Section 2 - Grammar

Lecture 12: Introduction to Computer Grammar
09:32
Lecture 13: Context Free Grammar Tutorial (CFG) Part 1
13:26
Lecture 14: Context Free Grammar Tutorial (CFG) Part 2
10:03
Lecture 15: Ardenâ€™s theorem
Text
Lecture 16: Reduce Grammar
4 pages
Lecture 17: Unit Production Removal
4 pages
Lecture 18: Context Free Grammar (CFG) to Chomsky Normal Form (CNF) part 1
05:00
Lecture 19: Context Free Grammar (CFG) to Chomsky Normal Form (CNF) part 2
05:53
Section 3 - Push Down Automata : PDA

Lecture 20: Introduction
Text
Lecture 21: (PDA) Push Down Automata in Details
50 pages
Lecture 22: Machine Configuration of Push Down Automata (PDA)
18:14
Lecture 23: Push Down Automata Tutorial (PDA) Examples Part 1
04:50
Lecture 24: Push Down Automata Tutorial (PDA) Examples Part 2
05:55
Lecture 25: Push Down Automata Tutorial (PDA) Examples Part 3
05:01
Section 4 - Turing Machine

Lecture 26: Introduction of Turing machine
Text
Lecture 27: Types of Turing Machines
Text
Lecture 28: Turing machine in Automata : Part 1
07:27
Lecture 29: Turing machine in Automata : Part 2
10:13
Lecture 30: Turing machine in Automata : Part 3
06:39
Lecture 31: Universal Turing Machine
Text
Section 5 - Pumping Lemma

Lecture 32: Pumping Lemma
9 pages
Section 6 - Machines in Automata Theory

Lecture 33: Merger graph and Merger Table
8 pages
Lecture 34: Synchronous Tree
6 pages
Lecture 35: Minimal Inverse machine
5 pages
Lecture 36: Machine Minimization
7 pages
Lecture 37: Lossless Machine
5 pages

## Who should attend

Engineering students of Computer science

Nothing

Nothing

## Key Takeaways

How compiler works.

## Date and Time

Not decided yet.

Avg Rating

Reviews

Students

Courses

I have more than 7 years of experience. You can search my sample videos in youtube channel.

## Reviews

No reviews currently

## Discussions

Students Interested 0 (Seats Left 0)

Post your requirement and let us connect you with best possible matches for Computer Software Classes Post your requirement now

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