Kontakt > Dydaktyka > 2017/2018 > - Authomata Theory and Formal Languages

- Authomata Theory and Formal Languages
Classes every two weeks.

Dates of classes:

  • C1 - 10.10.2017 - Equivalence relation, equivalence classes.
  • C2 - 24.10.2017 - Regular languages. Contraposition of pumping lemma. The Myhill-Nerode lemma.
  • C3 - 07.11.2017 - Context–free grammar. Chomsky Normal Form. Greibach Normal Form.
  • C4 - 21.11.2017 - Context-free languages.  CYK algorithm. Pumping lemma for context-free languages.
  • C5 - 05.12.2017 - Deterministic Turing machines alculates the value of the function and accepting languages. Deterministic push-down automaton. 
  • C6 - 19.12.2017 - Deterministuc finite automata. Design a deterministic finite automaton using Myhill-Nerode theorem and using quotient of languages.
  • C7 - 16.01.2018 - Nondeterministuc finite automata. Convertion ε-NFA to NFA and DFA.
  • C8 - 23.01.2018 - Resit.
Powered by CMSimple