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

- Authomata Theory and Formal Languages


Classes every two weeks.

Dates of classes:

  • C1 - 09.10.2018 - Equivalence relation, equivalence classes.
  • C2 - 23.10.2018 - Regular languages. Contraposition of pumping lemma. The Myhill-Nerode lemma.
  • C3 - 06.11.2018 - Context–free grammar. Chomsky Normal Form. Greibach Normal Form.
  • C4 - 20.11.2018 - Context-free languages.  CYK algorithm. Pumping lemma for context-free languages.
  • C5 - 04.12.2018 - Deterministic Turing machines calculates the value of the function and accepting languages. 
  • C6 - 18.12.2018 - Push-down automata. 
  • C7 - 15.01.2019 - Finite automata. Convertion ε-NFA to NFA and DFA. Design a deterministic finite automaton using Myhill-Nerode theorem and using quotient of languages.
  • C8 - 22.01.2019 - Resit.
Powered by CMSimple