You must be logged in to take this course → LOGIN | REGISTER NOW
Automata theory is the study of abstract machines and automata, including the computational problems that can be solved using them. The major objective of automata theory is to develop methods by which computer scientists can describe and analyse the dynamic behaviour of discrete systems, in which signals are sampled periodically.
The [course_title] course covers the fundamental concepts of automating theory including finite automaton (FA) which is a simple idealised machine used to recognise patterns within input taken from some character set (or alphabet) C. A finite automaton consists of: a finite set S of N states. The course discusses all these theories along with the Context-free grammars, Turing machines and decidability, and the theory of intractability, or NP-complete problems.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: Stanford University
Course Curriculum
Week 1: Finite Automata | |||
00:00 | |||
00:00 | |||
00:00 | |||
00:00 | |||
00:00 | |||
Week 2: Regular Expressions and Properties of Regular Languages | |||
00:00 | |||
00:00 | |||
00:00 | |||
00:00 | |||
00:00 | |||
Week 3: Context-Free Grammars and Pushdown Automata | |||
00:00 | |||
00:00 | |||
00:00 | |||
Week 4: Pushdown Automata and Properties of Context-Free Languages | |||
00:00 | |||
00:00 | |||
00:00 | |||
00:00 | |||
00:00 | |||
Week 5: Turing Machines and Undecidability | |||
00:00 | |||
00:00 | |||
00:00 | |||
00:00 | |||
Week 6: Intractable Problems and NP-completeness | |||
00:00 | |||
00:00 | |||
00:00 | |||
00:00 | |||
Assessment | |||
Submit Your Assignment | 00:00:00 | ||
Certification | 00:00:00 |
Course Reviews
No Reviews found for this course.