Automata Theory

  • Instructor: Jonas Schneider
  • Lectures: 39
  • Students: 3247
  • Duration: 10 weeks

Automata Theory is a branch of computer science that deals with designing abstract selfpropelled computing devices that follow a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton. This is a brief and concise tutorial that introduces the fundamental concepts of Finite Automata, Regular Languages, and Pushdown Automata before moving onto Turing machines and Decidability.

Certification

Academy Europe presents high-quality formal diplomas, certificates and e-certificates which are formal proof and recognition of accredited online courses. It shows all student’s abilities to learn and achieve high results and is very useful to promote personal career including with CVs, job applications and self improvements.

Samples: Horizantal Diploma – Horizantal Certificate – Vertical E-Certificate



How can you get your certificate at Academy Europe?

  • You must click “complete” link at the end of every lesson of your course after you finish them.
  • When you finish all lessons of course, the “finish course” link is going to be active at the end of last lesson.
  • When you click the “finish course” link, you will finish your course on Academy Europe officially. Then, “certificate” page of you completed course will be automatically active.
  • You can see and download your certificate online after you click on your “certificate” link.

Audience

This tutorial has been prepared for students pursuing a degree in any information technology or computer science related field. It attempts to help students grasp the essential concepts involved in automata theory.

This course by Academy Europe aims at imparting quality education and training to students.

Academy Europe is dedicated to its students, their specific learning requirements, and their overall learning success.

This course is directed toward a student-centered, independent study, asynchronous learning approach.

After completing this course on Academy Europe, students will get self improvement  and promotion in their careers.

This course is based on at least two learning skills which are provided  to the users through audio & visuals, videos, verbal presentations and articles, all of which are asynchronized with distance education approach.



Prerequisites

This tutorial has a good balance between theory and mathematical rigor. The readers are expected to have a basic understanding of discrete mathematical structures.

Before you start proceeding with this course on Academy Europe, we are assuming that you have a good aptitude and can think logically. You should want to try something different.

Ideal candidates for the course would typically possess:

– Discipline and attentiveness

– Ability to conduct research

– Ability to perform tasks with speed, efficiency, and accuracy

– Analytical judgment

– Patience to interpret technical/scientific data

– A willingness to learn, roll up your sleeves and work toward your dream!

– A computer, tablet or smartphone and an internet connection

– Basic computer skills


  • Automata Theory Introduction 0/1

  • Deterministic Finite Automaton 0/1

  • Non-deterministic Finite Automaton 0/1

  • NDFA to DFA Conversion 0/1

  • DFA Minimization 0/1

  • Moore and Mealy Machines 0/1

  • Classification of Grammars 0/3

  • Regular Grammar 0/6

  • Context-Free Grammars 0/7

  • Pushdown Automata 0/4

  • Turing Machine 0/7

  • Decidability 0/5

  • Completion of Course 0/1

Price

Free