Fundamentals of Automata Theory
Requirements
- No
Description
In this course, you will learn the fundamentals of the following Automaton
Deterministic Finite Automata
Non Deterministic Finite Automata
Non Deterministic Finite Automata with Epsilon Transition
Push Down Automata
Linear Bound Automata
Turing Machine.
Note that only the definitions and an example of each automaton are thought here because the free course in Udemy has some limitations.
You can take this course to have brief idea about various automata. If you wish to learn in more detail, I recommend you to take the course Introduction to Theory of Computation offered by me.
Who this course is for:
- Computer Science Students
- GATE Aspirants
Instructor
![Jithin Parakka](data:image/svg+xml,%3Csvg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64"%3E%3C/svg%3E){kind=avatar}
- 3.8 Instructor Rating
- 199 Reviews
- 5,856 Students
- 4 Courses
Jithin Parakka is Professor and Head of the Department of Computer Science and Engineering, St. Thomas College of Engineering & Technology, Kerala, India. Jithin Parakka has many years of teaching experience and is very enthusiastic towards e-learning. His area of interest includes, Data structures, Algorithm design and analysis, Automata theory and Compiler design.