Theory of Computation and Automata - Part 1
What you'll learn
- Automata Theory
- Theory of Computation
- Finite Automata (FA)
- FA with output
- Regular Expressions
- Finite State Machines
- An open mind full of excitement to learn and grasp new things.
The course will walk you through the basics of Automata Theory, alternatively known as Theory of Computer/Computation Science. Its one of the most important subjects in the curriculum of Computer Science and Information Technology. All the modern day computers are designed on the basis of the simple automation models. We will learn some of those models in this part of the course.
The complete course is divided into 3 parts.:
Part 1: Introduction , Finite Automata and Introduction to Regular Expressions
Part 2 : Grammar and Push Down Automata
Part 3 : Turing Machines and Undecidability Problems
This course will cover the 1st part of the course. Subsequent parts will be released in the follow up courses.
Who this course is for:
- Students with an attitude to learn and solve problems
- Students willing to understand the mathematics behind automation
- Students who wish to learn Automata Theory and Theory of Computation
Hello Everyone, I am Assistant Professor Mr. Sridhar Iyer, working with the University of Mumbai for the last 6 years. I always believe in "Sharing Knowledge".
I am rolling out a series of Video Tutorial Hands-On sessions on upcoming technologies and academic subjects based on my expertise and comfort. I am beginning with lab sessions on a fairly new subject "Advanced System Security and Digital Forensics".
I am a Certified Ethical Hacker by E.C. Council USA and have my core expertise in Cryptography and System Security. I believe in sharing whatever knowledge and experience I have gained so far in my short but sweet stint as a Teacher.
I hope this series of lectures and lab sessions help you learn something useful and interesting.