AUTOMATA THEORY

Course Reviews

Track :

Programming

Lessons no : 40

For Free Certificate After Complete The Course

To Register in Course you have to watch at least 30 Second of any lesson

Join The Course Go To Community Download Course Content

How to Get The Certificate

You must have an account Register
Watch All Lessons
Watch at least 50% of Lesson Duration
you can follow your course progress From Your Profile
You can Register With Any Course For Free
The Certificate is free !

Lessons | 40

00:09:23

INTRODUCTION TO AUTOMATA THEORY AND ITS APPLICATIONS || THEORY OF COMPUTATION || FORMAL LANGUAGES

00:14:58

BASIC NOTATIONS REPRESENTATIONS IN AUTOMATA THEORY || BASICS OF AUTOMATA || THEORY OF COMPUTATION

00:14:14

WHAT IS FINITE AUTOMATA AND REPRESENTATION OF FINITE AUTOMATA || THEORY OF COMPUTATION

00:14:54

TYPES OF FINITE AUTOMATA DFA NFA IN AUTOMATA THEORY || DFA NFA || THEORY OF COMPUTATION

00:16:19

DETERMINISTIC FINITE AUTOMATA DFA EXAMPLE 1 STRINGS STARTS WITH IN AUTOMATA THEORY || TOC

00:14:17

DETERMINISTIC FINITE AUTOMATA DFA EXAMPLE 2 STRINGS ENDS WITH IN AUTOMATA THEORY || TOC

00:15:49

DETERMINISTIC FINITE AUTOMATA DFA EXAMPLE 4 STRING LENGTH IN AUTOMATA THEORY || TOC

00:16:09

DETERMINISTIC FINITE AUTOMATA DFA EXAMPLE 5 DIVISIBLE BY IN AUTOMATA THEORY || TOC

00:14:07

DETERMINISTIC FINITE AUTOMATA DFA EXAMPLE 6 EVEN S ODD S IN AUTOMATA THEORY || TOC

00:14:56

DETERMINISTIC FINITE AUTOMATA DFA EXAMPLE 3 SUBSTRING OR CONTAINS IN AUTOMATA THEORY || TOC

00:08:02

NFA NON DETERMINISTIC FINITE AUTOMATA WITH EXAMPLE IN AUTOMATA THEORY || THEORY OF COMPUTATION

00:10:19

DIFFERENCES BETWEEN DFA NFA IN AUTOMATA THEORY || DFA NFA || THEORY OF COMPUTATION

00:10:15

EPSILON CLOSURE IN AUTOMATA THEORY || NFA WITH EPSILON || TOC

00:21:35

CONVERSION OF NFA WITH EPSILON TO NFA WITHOUT EPSILON IN AUTOMATA THEORY || TOC

00:18:06

CONVERSION OF NFA TO DFA WITH EXAMPLES IN AUTOMATA THEORY || NFA TO DFA CONVERSION || TOC

00:19:28

MINIMIZATION OF DFA WITH EXAMPLE IN AUTOMATA THEORY || DFA MINIMIZATION || TOC

00:10:55

EQUIVALENCE BETWEEN TWO DFA IN AUTOMATA THEORY || EQUIVALENCE BETWEEN TWO FSM S || TOC

00:13:45

REGULAR EXPRESSIONS IN AUTOMATA THEORY || REGULAR EXPRESSION WITH EXAMPLE || TOC

00:05:00

IDENTITY RULES FOR REGULAR EXPRESSIONS IN AUTOMATA THEORY || IDENTITIES OF REGULAR EXPRESSIONS ||TOC

00:11:52

ARDEN S THEOREM IN AUTOMATA THEORY || EQUIVALENCE OF TWO REGULAR EXPRESSIONS || DFA TO RE || TOC

00:21:08

CONVERSION OF FINITE AUTOMATA TO REGULAR EXPRESSION USING ARDENS METHOD IN AUTOMATA THEORY || TOC

00:28:29

CONVERSION OF FINITE AUTOMATA TO RE USING STATE ELIMINATING METHOD IN AUTOMATA THEORY || TOC

00:20:53

CONVERSION OF REGULAR EXPRESSION TO FINITE AUTOMATA USING SUBSET METHOD IN AUTOMATA THEORY || TOC

00:13:13

CONVERSION OF REGULAR EXPRESSION TO FINITE AUTOMATA USING DIRECT METHOD IN AUTOMATA THEORY || TOC

00:16:39

PUMPING LEMMA IN AUTOMATA THEORY || PUMPING LEMMA FOR REGULAR LANGUAGES WITH EXAMPLES || TOC

00:19:49

REGULAR GRAMMAR IN AUTOMATA THEORY || GRAMMAR || LEFT LINEAR GRAMMAR || RIGHT LINEAR GRAMMAR || TOC

00:09:55

CONTEXT FREE GRAMMAR IN AUTOMATA THEORY || CFG IN ATFL || TOC || AUTOMATA THEORY

00:13:56

DERIVATION TREE PARSE TREE IN AUTOMATA THEORY || DERIVATION || TOC

00:15:41

TYPES OF DERIVATION TREE LEFT MOST RIGHT MOST IN AUTOMATA THEORY || TOC

00:10:53

AMBIGUOUS GRAMMAR IN AUTOMATA THEORY || AMBIGUITY IN CONTEXT FREE GRAMMAR || TOC

00:08:11

DIFFERENCE BETWEEN REULAR GRAMMAR AND CONTEXT FREE GRAMMAR IN AUTOMATA THEORY || TOC

00:08:46

REMOVAL OF USELESS PRODUCTIONS SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC

00:10:28

REMOVAL OF NULL EPSILON PRODUCTIONS SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC

00:11:26

REMOVAL OF UNIT PRODUCTIONS SIMPLIFICATION OF CFG IN AUTOMATA THEORY || TOC

00:30:42

CHOMSKY NORMAL FORM CNF CONVERSION OF CFG TO CNF IN AUTOMATA THEORY || CFG TO CNF || TOC

00:14:32

TYPES OF RECURSIONS AND REMOVAL OF LEFT RECURSION IN AUTOMATA THEORY || LEFT RECURSION || TOC

00:26:59

GREIBACH NORMAL FORM GNF AND CONVERSION OF CONTEXT FREE GRAMMAR TO GNF IN AUTOMATA THEORY || TOC

00:11:42

PUSHDOWN AUTOMATA PDA IN AUTOMATA THEORY || PDA INTRODUCTION || WHAT IS PDA

00:19:44

PUSHDOWN AUTOMATA EXAMPLE a n b n | PDA EXAMPLE | TOC

00:14:23

INSTANTANEOUS DESCRIPTION ID OF PDA IN AUTOMATA THEORY || ID OF PDA || ACCEPTANCE OF STRING || TOC

Show More Lessons

We Appreciate Your Feedback

Excellent		305 Reviews
Good		304 Reviews
medium		27 Reviews
Acceptable		7 Reviews
Not Good		5 Reviews

4.4

648 Reviews

baikan swapna

Very good explanation 2025-05-16

Ketham Harika

Good experience 2025-05-16

Kesari Vamshi sai

Excellent 2025-05-16

POTHULA VIJAYA DURGA

Good 2025-05-15

Show More Reviews

Our New Certified Courses Will Reach You in Our Telegram Channel
Join Our Telegram Channels to Get Best Free Courses

Join Now

Related Courses

33 Lessons

PHP MySQL Stripe API Payment App

Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. The word automata comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving".