Formal Languages and Automata Theory

Formal Languages and Automata Theory

Introduction to Automata Theory, Languages and Computation

What you’ll learn

  • Develop a formal notation for strings, languages and machines.
  • Design finite automata to accept a set of strings of a language.
  • Prove that a given language is regular and apply the closure properties of languages.
  • Design context free grammars to generate strings from a context free language and convert them into normal forms.
  • Prove equivalence of languages accepted by Push Down Automata and languages generated by context free grammars.
  • Identify the hierarchy of formal languages, grammars and machines
  • Distinguish between computability and non-computability and Decidability and undecidability.


  • Mathematical Foundations of Computer Science
  • Data structures and Algorithms
  • Database Management System

Who this course is for:

  • Engineering-Undergraduate/Postgraduate
Tutorial Bar