|
Lecturer(s)
|
-
Benešová Martina, Mgr. Ph.D.
-
Andres Jan, prof. RNDr. dr hab. DSc.
-
Zámečník Hadwiger Lukáš, Mgr. Ph.D.
-
Jurková Barbora, Mgr.
|
|
Course content
|
Week 1: General introduction, introduction of the course and materials Week 2: Introduction to formal grammar Week 3: Introduction to automata theory Week 4: Regular Grammars Week 5: Context-free grammars Week 6: Contextual Grammars Week 7: Type 0 Grammars Week 8: Introduction to Graph Theory Weeks 9 - 10: Graph Theory Week 11: Examples and special types of graphs Week 12: Repetition Week 13: Credit Test
|
|
Learning activities and teaching methods
|
|
Dialogic Lecture (Discussion, Dialog, Brainstorming), Work with Text (with Book, Textbook)
|
|
Learning outcomes
|
The aim of the course is to introduce students to the basic concepts of formal grammar. During the course, students will recall the basics of mathematics and be introduced to automata theory and graph theory. Students will then be able to apply their knowledge not only in other linguistics courses but also, for example, in practically oriented courses such as programming.
The course is introduced by revision of basic tools of mathematics, e.g. mathematical terminology, number domains, their qualities and graphs (linear, quadratic, exponential, logarithmic). From basic qualities of functions, qualities of inverse functions are derived. This is demonstrated using valid linguistic laws (e.g. Zipf and Menzerath-Altmann laws). The second half of the course covers basics of combinatorics and probability theory so that the fundamentals of statistics crucial for assessing validity of linguistic experiments can follow. The course complemented by short practical applications of the knowledge acquired.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Student performance, Seminar Work
Max. 3 absences Class work and completion of assignments Completion of the final test
|
|
Recommended literature
|
|