Automata Theory | Theory of Computation Beginner to advanced
DFA | NFA | ε NFA | Push-down Automata | Linear Bound Automata | Turing Machine | Moore & Mealy Machine | Chomsky | Regx
3.83 (67 reviews)
353
students
7.5 hours
content
Apr 2020
last update
$59.99
regular price
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
Screenshots
Related Topics
2472104
udemy ID
7/23/2019
course created date
4/13/2020
course indexed date
Bot
course submited by