Automata Theory - Theory of Computation Beginner to advanced

Automata Theory | Theory of Computation Beginner to advanced, available at $59.99, has an average rating of 3.55, with 96 lectures, 8 quizzes, based on 66 reviews, and has 349 subscribers.

You will learn about Fundamentals of Automata Theory Fundamentals of finite state machines: DFA, NFA, Epslion NFA, Moore Machine, Mealy Machine and thier design Regular languages and regular expressions Context free languages / grammar and its normal forms Design of pushdown automata for given context free language Different vairants of Turing machine and thier design + The halting problem Context sensitive language and Linear Bound Automata Recursive and recursively enumerable languges This course is ideal for individuals who are Students studying computer science It is particularly useful for Students studying computer science.

Enroll now: Automata Theory | Theory of Computation Beginner to advanced

Summary

Title: Automata Theory | Theory of Computation Beginner to advanced

Price: $59.99

Average Rating: 3.55

Number of Lectures: 96

Number of Quizzes: 8

Number of Published Lectures: 96

Number of Published Quizzes: 8

Number of Curriculum Items: 120

Number of Published Curriculum Objects: 120

Original Price: ?1,199

Quality Status: approved

Status: Live

What You Will Learn

Fundamentals of Automata Theory

Fundamentals of finite state machines: DFA, NFA, Epslion NFA, Moore Machine, Mealy Machine and thier design

Regular languages and regular expressions

Context free languages / grammar and its normal forms

Design of pushdown automata for given context free language

Different vairants of Turing machine and thier design + The halting problem

Context sensitive language and Linear Bound Automata

Recursive and recursively enumerable languges

Who Should Attend

Students studying computer science

Target Audiences

Students studying computer science

Many find it very difficult to learn and understand the concepts of Automata Theory. Few are thinking that only people with strong mathematical foundations can master this topic.

Here I am presenting the topic in a rather simple way with the help of simulating tools, animations, and activities that will help you to understand the topic effectively.

The curriculum is created in such a way that it covers all the fundamentals and matches the syllabus of universities around the world.

The lectures are designed in such a way that you don’t need to follow the hierarchy and can always jump to the lecture you needed. 

I have included many activities for practice and quiz for your self-test.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction to Automata Theory and its significance

Lecture 2: Instructor Introduction

Lecture 3: Fundamentals

Chapter 2: Finite State Automata

Lecture 1: Deterministic Finite State Automata (DFA)

Lecture 2: Representation of Finite Automata

Lecture 3: Extended Transition Function

Chapter 3: Design of Finite Automata

Lecture 1: Introduction to JFLAP

Lecture 2: Designing Finite Automata with JFLAP

Lecture 3: Simulating FA in JFLAP

Lecture 4: FA accept all the strings of as and bs starting with ab

Lecture 5: FA accept all the strings of as and bs ends with aa

Lecture 6: FA accept all the strings starts and ends with the same symbol

Lecture 7: Every string contain substring aba

Lecture 8: 3rd symbol from left end is always b

Lecture 9: Design problem on number of alphabets in string

Lecture 10: Every string contain an odd number of 0s and an even number of 1s

Lecture 11: Design problem on length of string

Lecture 12: Design problem on string not contain a particular substring

Lecture 13: Practical Application

Chapter 4: DFA Minimisation

Lecture 1: Myhill-Nerode Theorem

Lecture 2: Minimal State FA Computation

Chapter 5: Non Deterministic Finite Automata (FA)

Lecture 1: Nondeterministic Finite Automata (NFA)

Lecture 2: Comparison of NFA & DFA

Lecture 3: Extended transition function

Lecture 4: Conversion of NFA to DFA

Lecture 5: Equivalence of Deterministic and Nondeterministic Finite Automata

Chapter 6: Finite Automata with Epsilon Transition

Lecture 1: Finite Automata with Epsilon Transitions

Lecture 2: Epsilon Closure

Lecture 3: Conversion of Epsilon NFA to NFA

Lecture 4: Extended Transition Function

Chapter 7: Finite State Machines with Output

Lecture 1: Moore machine

Lecture 2: Design of Moore machine which counts the occurrence of substring aab

Lecture 3: Mealy machine

Lecture 4: Design of Mealy machine which print 1s complement of a number

Lecture 5: Comparison of Moore machine and Mealy machine

Lecture 6: Two- Way Finite Automata

Chapter 8: Regular Expressions

Lecture 1: Regular Expressions

Lecture 2: Building Regular Expressions 1

Lecture 3: Building Regular Expressions 2

Lecture 4: Converting Regex to Epsilon NFA

Lecture 5: Converting Regular Expressions (ab+a)* to NFA with epsilon transitions

Lecture 6: Equivalence of regular expressions and NFA with epsilon transitions

Lecture 7: Converting DFA to Regular Expressions

Lecture 8: Regex DFA Conversion example

Chapter 9: Regular Languages

Lecture 1: Regular Language: Language of Automata

Lecture 2: Pumping Lemma for Regular Languages

Lecture 3: Applications of the Pumping Lemma

Lecture 4: Proof for Pumping Lemma

Lecture 5: Closure Properties of Regular sets

Lecture 6: Proof and Example for closure properties

Chapter 10: Context Free Languages

Lecture 1: Context Free Grammar

Lecture 2: Design of CFG for L={a^nb^n/n>0}

Lecture 3: Design CFG for L={wcw^R/ w is in (0+1)*}

Lecture 4: Design of CFG for string of balanced parentheses

Lecture 5: CFG for string having Equal number of as and bs

Lecture 6: Leftmost and Rightmost Derivation

Lecture 7: Derivation Tree / Parse Tree

Lecture 8: Ambiguous Grammar

Lecture 9: Closure properties of CFL

Lecture 10: Decision problems associated with CFL

Lecture 11: Pumping lemma for CFL

Lecture 12: Application of pumping lemma

Chapter 11: Normal Forms for CFL

Lecture 1: Simplification of CFG

Lecture 2: Chomsky Normal Form

Lecture 3: Left Recursive Grammar

Lecture 4: Greibach normal forms

Instructors

Jithin Parakka
CTO and Cofounder @ Mapletechspace.com

Rating Distribution

1 stars: 8 votes

2 stars: 4 votes

3 stars: 8 votes

4 stars: 15 votes

5 stars: 31 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!