This course was created with the
course builder. Create your online course today.
Start now
Create your course
with
Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Theory of Computation & Formal Language | Theory of Automata
Introduction
Why this course (1:34)
Course overview (1:14)
What is Automata ?
Automata Definition , Language Fundamentals , Defining Languages (4:40)
Descriptive Definition of Language
Descriptive Definition of Language (4:20)
Recursive Definition of Languages
Kleen Star Closure and Kleen Plus (7:13)
Defining Languages Recursively (6:16)
Regular Expression ( RE )
What is Regular Expression ( RE ) ? (4:52)
Defining Languages by Regular Expression ( RE ) (4:38)
Equivalent Regular Expression and misconceptions (3:26)
Finite Automaton ( FA )
Finite Automaton , Transition table and Transition diagram (6:01)
Equivalent FA's (5:38)
Examples (5:01)
Some More Examples (2:17)
FA corresponding to Finite Languages (10:33)
Transition Graph ( TG )
Transition Graph and some Examples (5:45)
Some more Languages (5:08)
Generalized Transition Graph ( GTG )
Generalized Transition Graph and examples (4:11)
Nondeterministic Finite Automaton ( NFA )
Nondeterminism and Nondeterministic Finite Automaton (5:27)
Converting NFA to DFA (4:39)
Context Free Grammar ( CFG ) and Context Free language ( CFL )
Context Free Grammar , CFG Terminologies (3:48)
Note
Context Free Language (CFL) and examples (2:25)
More Examples (5:36)
Trees (2:32)
Ambiguous & Unambiguous CFG (2:11)
Total language tree (2:29)
Why this course
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock