StudyPath

CSC 351 Formal Languages and Automata Theory

300 levelComputing & ICT10 topics

CSC 351 covers 10 topics. StudyPath paces them into daily study sessions that finish before your exam date, with practice questions and worked answers for each one.

Study CSC 351 on StudyPath

Free for every student. No card.

Course outline

The topics this course covers, in teaching order.

  1. Alphabets, strings and languages
  2. Finite automata (DFA and NFA)
  3. Equivalence of DFA and NFA
  4. Regular expressions and regular languages
  5. Pumping lemma for regular languages
  6. Context-free grammars and derivations
  7. Normal forms (Chomsky and Greibach)
  8. Pushdown automata
  9. Turing machines
  10. The Chomsky hierarchy and decidability

A sample from this course

One topic, as StudyPath teaches it.

Alphabets, strings and languages

This topic introduces the basic objects of formal language theory: alphabets as finite sets of symbols, strings as finite sequences formed from those symbols, and languages as sets of strings. These ideas matter because every later topic in automata theory—regular expressions, finite automata, grammars, and Turing machines—builds on being able to describe symbols, form words, and define sets of valid words precisely.

What you get for CSC 351