Skip to main content
🇬🇷 ELLog inApply now

Computing & engineering · Individual course

Automata and Formal Languages (CS 250)

Idealized mathematical models of computation: what machines can and cannot compute (CS 250).

$40 one-time180 lessons20h 49mSelf-pacedCertificate of completion
Enroll on aclas.collegeFull catalog

Outline

25 sections

  1. 01Course Intro & Syllabus
  2. 02Section 1: Course Introduction & Overview of Computation
  3. 03Section 2: Math Notions, Theorems, and Proofs
  4. 04Section 3: Deterministic Finite Automata
  5. 05Section 4: Nondeterministic Finite Automata
  6. 06Section 5: Regular Expressions and Equivalence
  7. 07Section 6: Nonregular Languages and the Pumping Lemma
  8. 08Section 7: Context-Free Grammars
  9. 09Section 8: Pushdown Automata
  10. 10Section 9: Non-Context-Free Languages
  11. 11Section 10: Deterministic Context-Free Languages
  12. 12Midterm Exam
  13. 13Section 11: Turing Machines
  14. 14Section 12: Variants of Turing Machines & The Definition of Algorithm
  15. 15Section 13: Decidable Languages
  16. 16Section 14: Undecidability and the Halting Problem
  17. 17Section 15: Undecidable Problems from Language Theory
  18. 18Section 16: Computation Histories and Mapping Reducibility
  19. 19Section 17: Measuring Complexity and The Class P
  20. 20Section 18: The Class NP
  21. 21Section 19: NP-Completeness and the Cook-Levin Theorem
  22. 22Section 20: Additional NP-Complete Problems
  23. 23Section 21: Space Complexity and Savitch's Theorem
  24. 24Section 22: PSPACE-Completeness and The Complexity Universe
  25. 25Final Exam

Course facts

Course details

Course
Automata and Formal Languages (CS 250)
Course code
CS 250
Track
Computing & engineering
Price
$40 $64.99
Lessons
180
Estimated study time
20h 49m
Delivery
100% online, self-paced
Language
English
On completion
Certificate of completion — a non-degree credential
Course page on aclas.college

What you receive

Certificate of completion

Completing all lessons and activities in this course produces an official certificate of completion with a unique verification ID.

Automata and Formal Languages (CS 250) — sample certificate of completion issued by ACLAS

Course completion certificate

Issued in the learner's name upon completing this course. Includes the course title, date of completion, and a unique certificate ID verifiable worldwide.

Course certificates recognize completion of standalone professional study. They carry a unique certificate ID that can be authenticated online at any time.

How it fits

Take it alone, or build a credential

A single course earns a certificate of completion. Four related courses earn a named certificate. A structured set of seven to fourteen earns a degree.

On its own

Certificate of completion

Finish this course and receive a certificate of completion naming the course. No further commitment.

In a certificate

A named credential

23 named programs bundle four related courses from this catalog, completed within twelve months.

Browse certificates

Inside a degree

Academic credit

Many of these courses are also taught inside the five ACLAS degrees, where they carry academic credit.

Compare degrees

Course catalogAll 66 individual courses by trackCertificate programs23 named programs from $39Degree programsFive degrees carrying academic creditAdmissions and tuitionPayments, installments and optional document fees

Enroll in Automata and Formal Languages (CS 250)

USD 40 one-time. Self-paced, online, with a certificate of completion at the end.

Apply nowSee the catalog

Or email [email protected]