Graduate study programme

Back   Schedule   Hrvatski

Automation and Formal Languages DR1-02

ECTS 6 | P 30 | A 15 | L 15 | K 0 | ISVU 149718 | Academic year: 2019./2020.

Course groups

Prikaži sve grupe na predmetu

Course lecturers

JOB JOSIP, Lecturer

Goals

Present the principles of formal languages and automata. Give insights into formal languages, Turing machine and basics in computation.

Conditions for enrollment

Requirements met for enrolling in the study programme

Course description

Context-free languages. Context sensitive languages. Derivation tree. Grammars and machines. Chomsky hierarchy, closure properties, regular and finite languages. Push-down automaton and context free grammars. Parsing. Turing machine and language theory. Fixed point principle and language theory. Inductions. Semantic types: operational, formal and axiomatic. Computability. Problem of programme finiteness and undecidability. Goedel theorem. Church - Turing thesis.

Student requirements

Defined by the Student evaluation criteria of the Faculty of Electrical Engineering, Computer Science and Information Technology Osijek and paragraph 1.9

Monitoring of students

Defined by the Student evaluation criteria of the Faculty of Electrical Engineering, Computer Science and Information Technology Osijek and paragraph 1.9

Obligatory literature

1. 1 Linz, Peter An Introduction to Formal Languages and Automata Jones & Bartlett, 5th edition, 2012

2. 2 Srbljić, S. JEZIČNI PROCESORI 1: Uvod u teoriju formalnih jezika, automata i gramatika Udžbenik Sveučilišta u Zagrebu. Zagreb : Element, 2000.


Pretraži literaturu na:

Recommended additional literature

1. 1 S. Srbljić Uvod u teoriju računarstva Element, Zagreb, 2007.

2. 2 S. Srbljić Prevođenje programskih jezika Element, Zagreb, 2007.

3. 3 Moll R., Arbib M.A. i Kfoury A.J. An introduction to formal language theory Springer Verlag 1987.

Course assessment

Conducting university questionnaires on teachers (student-teacher relationship, transparency of assessment criteria, motivation for teaching, teaching clarity, etc.). Conducting Faculty surveys on courses (upon passing the exam, student self-assessment of the adopted learning outcomes and student workload in relation to the number of ECTS credits allocated to activities and courses as a whole).

Overview of course assesment

Learning outcomes
Upon successful completion of the course, students will be able to:

1. have insight into formal languages

2. understand regular languages, grammars and expressions

3. understand context-free languages, grammars and automata

4. have insight into a Turing machine and basics of the theory of computation



Aktivnosti studenta: Vidi tablicu aktivnosti