Theory of computation from basics
Finite autometa and Regular language
4.11 (46 reviews)
1,890
students
1.5 hours
content
May 2020
last update
FREE
regular price
What you will learn
Theory of Computation - Computer Science Engineering 4th semester subject notes
Autometa
Deterministic finite Autometa, Non Deterministic Finite Autometa, Epsilon NFA with examples, Acceptebility of a string by DFA, Conversion from DFA to NFA
Related Topics
2797160
udemy ID
2/5/2020
course created date
5/1/2020
course indexed date
Bot
course submited by