​Theory of Computing II: Contextfree Languages and PDAs

Author: Prof. Dr. Andreas Schäfer
Offering Institution: Technische Hochschule Lübeck
Course Language: Английский
Field of Knowledge: Wirtschaftsinformatik Free of Charge
Average Workload: 50 Hours Free of Charge Enrol

What awaits you in this course?

Formal Languages and Automata provide the basis for analyzing user input from addresses in web forms to complex Java code. This 3-part course provides the basics of the theory. It also shows the limits of each machine model and finally the limits of computability in general.

This course, building on the previous one, features contextfree languages and pushdown automata.

What can you learn in this course?

With the help of this course, we want you to achieve the following learning outcomes:

  • You can read and write the formal notation of a grammar and classify grammars with regard to the Chomsky hierarchy.
  • You can eliminate epsilon productions from grammars.
  • You can name operations that contextfree grammars are closed under.
  • You can proof that a language is not contextfree.
  • You can describe the idea and the mode of operation of pushdown automata.
  • You can transfer contextfree grammars into pushdown automata.

Outline

0. Organization
1. Grammars
2. Chomsky-Hierarchy
3. Elimination of Epsilon Productions
4. Closure Properties of Contextfree Languages
5. Pumping Lemma for Contextfree Languages
6. Intersection and Complement
7. Pushdown Automata
8. Pushdown Automata and Contextfree Languages

Further authors

Prof. Dr. Andreas Schäfer

Andreas Schäfer received his PhD 2007 from the Carl von Ossietzky University in Oldenburg, Germany. He then worked at the European Patent Office for 5 years. Since 2012 he is Professor of Computer Science  at the Technische Hochschule Lübeck. His interests include Automata Theory, Logic and Formal Methods. 


License

Creative Commons