SubjectsSubjects(version: 945)
Course, academic year 2023/2024
   Login via CAS
Parsing and Syntactic Analysis - NTIN046
Title: Rozpoznávání a syntaktická analýza
Guaranteed by: Department of Software and Computer Science Education (32-KSVI)
Faculty: Faculty of Mathematics and Physics
Actual: from 2017
Semester: both
E-Credits: 3
Hours per week, examination: 0/2, C [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: taught
Language: Czech
Teaching methods: full-time
Teaching methods: full-time
Note: you can enroll for the course repeatedly
you can enroll for the course in winter and in summer semester
Guarantor: RNDr. František Mráz, CSc.
Martin Plátek, CSc.
Class: Informatika Mgr. - volitelný
Classification: Informatics > Theoretical Computer Science
Pre-requisite : NTIN071
Annotation -
Last update: T_KSVI (11.05.2010)
Working seminary focused on methods of robust syntactic analysis of programming languages and natural languages, comparison of known methods and development of new methods for language processing. Subjects discussed within the framework of the seminary have a direct connection to ongoing research within several grant projects. Methods based on various models of list automata and restarting automata will be stressed.
Course completion requirements -
Last update: RNDr. František Mráz, CSc. (29.10.2019)

For obtaining credits for the seminar it is necessary active participation in the seminar and at least two presentations of papers from literature or results achieved by the student.

Continuous work throughout the whole term is required to obtain the credits, therefore there will be no additional possibilities to acquire them later.

Literature -
Last update: T_KSVI (11.05.2010)

G. Rozemberg, A. Salomaa (Eds.): Handbook of formal languages, Vol. 1,2,3, Springer, 1997.

F. Otto: Restarting automata. In Esik, Z., Martin-Vide, C. and Mitrana, V. (Eds): Recent Advances in Formal Languages and Applications, pages 269-303, Studies in Computational Intelligence 25, Springer-Verlag, Berlin.

Syllabus -
Last update: T_KSVI (11.05.2010)

There will be discussed results on parsing of natural and formal languages achieved by the participants of the seminary and others. The main topics are:

1. A comparative study of methods for parsing and recognition of languages, complexity of parsing and recognition.

2. A study of complexity classes of various types of (mainly restarting) automata.

3. Analysis by reduction and modeling of phenomena from natural languages by means of formal automata models.

4. Models for parsing pictures by automata with two-dimensional input.

5. Machine learning of languages - grammatical inference.

Charles University | Information system of Charles University |