• Kontakt
• Ogłoszenia
• Badania naukowe
• Prace dyplomowe 
• Dydaktyka
  • 2025/2026
  • 2024/2025
  • 2023/2024
  • 2022/2023
  • 2021/2022
  • 2020/2021
  • 2019/2020
  • 2018/2019
  • 2017/2018
  • 2016/2017
    • - IO 2 
    • - Programowanie 2
    • - Programowanie 1
    • - Teoria automatów i języków formalnych
    • - Authomata Theory and Formal Languages
    • - Analiza i przetwarzanie obrazów biometrycznych
  • 2015/2016

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

- Authomata Theory and Formal Languages

Classes are held every two weeks.

Dates of classes:

• C1 - 11.10.2016 - Equivalence relation, equivalence classes.
• C2 - 25.10.2016 - Regular languages. Contraposition of pumping lemma. The Myhill-Nerode lemma.
• C3 - 15.11.2016 - Context–free grammar. Chomsky Normal Form. Greibach Normal Form.
• C4 - 29.11.2016 - Context-free languages.  CYK algorithm. Pumping lemma for context-free languages.
• C5 - 13.12.2016 - Deterministic Turing machines alculates the value of the function and accepting languages. Deterministic push-down automaton. 
• C6 - 03.01.2017 - Deterministuc finite automata. Design a deterministic finite automaton using Myhill-Nerode theorem and using quotient of languages.
• C7 - 17.01.2017 - Nondeterministuc finite automata. Convertion ε-NFA to NFA and DFA.
• C8 - 24.01.2017 - Resit.