Introduction
- Introduction
- DFA
- DFA Example
- NFA
- Epsilon NFA
- Push Down Automata
- PDA Example
- Linear Bound Automata
- Turing Machine
- Example for TM
What you'll learn
- Fundamental Concept of Automatas
- Dterministic Finite Automata
- Non Deterministic FInite Automata
- Finite Automata with Epsilon Transition
- Push Down Automata
- Turing Machine
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.
The University of Sheffield
Other Courses
Learn Python and Automation in One Day - With Quizzes
A short and quick tutorial on Python with Quizzes after each module
Design ur code: All Steps before you start writing your code
A-Z about, Designing your code
AI Images with StableDiffusion for Marketing, Business & Art
Boost Your Marketing Game with AI Genarated Images. Learn StableDiffusion and MageSpace - both free tools!
About the instructors
- 4.03 Calificación
- 6217 Estudiantes
- 4 Cursos
Jithin Parakka
CTO and Cofounder @ Mapletechspace.com
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.
Student feedback
4.35
Course Rating
Reviews
Rajagopal T K P
04-11-2023
Ammazing
Allen Christopher
19-06-2023
good teaching
Nitin Kumar Shah
19-06-2023
nice