Elements of Automata and Formal Languages 510-IS1-3TAJF-23-ENG

Course profile: General Academic
Form of study: Full-time studies
Course type: Obligatory
Year/semester of study: 3 / 5
Teaching methods: Lectures, laboratory classes
ECTS credits: 4
Balance of student workload:
Class attendance:
- lecture 30h
- laboratory classes 30h

Course preparation:
- lecture 5h
- laboratory classes 10h
Exam preparation: 15h
Exam duration: 2h
Individual consultation with the teacher: 13h

Student workload:
Direct interaction with the teacher: 75, 3 ECTS
work without interaction with teacher: 30, 1 ECTS

Rodzaj przedmiotu

Założenia (opisowo)

The course aims to show the theoretical foundations of programming. Computational models such as finite automata, pushdown automata and Turing machines are introduced. The student also learns about the theory of formal languages: regular, context-free, contextual and unbounded languages and grammars.

Koordynatorzy przedmiotu

Wojciech Lesiński

Efekty kształcenia

Students knows the classical concepts and results of the theory of formal languages formal languages and automata (regular languages,
context-free, contextual, class 0, grammars for languages in the Chomsky hierarchy, finite automata, stack automata, Turing machines) KA6_WG1(+) KA6_WG14 (+++) KA6_UW5(+++)

Students can use the methods of the theory of formal languages
in computer science, as well as perform formal and correct reasoning in the area of formal languages KA6_UW16 (+++) KA6_UW22(+++) KA6_UU1 (+) KA6_KK1(+++)

Kryteria oceniania

Form of assessment: exam

Literatura

Hopocroft J.E., Motwani R, Ullman J. D., Introduction to Automata Theory, Languages, and Computation, Pearson, 2013

Więcej informacji

Dodatkowe informacje (np. o kalendarzu rejestracji, prowadzących zajęcia, lokalizacji i terminach zajęć) mogą być dostępne w serwisie USOSweb:

Strona przedmiotu 510-IS1-3TAJF-23-ENG w USOSweb