|
ECTS:
|
6
|
Lecturers in charge:
|
Prof. dr. sc.
Siniša Srbljić
Prof. dr. sc.
Zoran Kalafatić
|
Lecturers:
|
Prof. dr. sc.
Joško Radej - Lectures
Doc. dr. sc.
Andro Milanović - Lectures
Dr. sc.
Ivan Benc - Lectures
Dr. sc.
Miroslav Popović - Lectures
Dr. sc.
Daniel Skrobo - Lectures
Dr. sc.
Dejan Škvorc - Lectures
dipl. ing.
Ivan Budiselić - Laboratory exercises
dipl. ing.
Goran Delač - Laboratory exercises
mag. ing. comp.
Zvonimir Pavlić - Laboratory exercises
dipl. ing.
Marin Šilić - Laboratory exercises
Dr. sc.
Dejan Škvorc - Exercises
dipl. ing.
Danko Ivošević - Exercises
dipl. ing.
Ivan Žužak - Exercises
|
Take exam:
|
Studomat
|
English level:
1,0,0
|
All teaching activities will be held in Croatian. However, foreign students in mixed groups will have the opportunity to attend additional office hours with the lecturer and teaching assistants in English to help master the course materials. Additionally, the lecturer will refer foreign students to the corresponding literature in English, as well as give them the possibility of taking the associated exams in English.
|
|
Load:
|
| Lecture type | Total |
| Lectures |
45 |
| Exercises |
15 |
| Laboratory exercises |
15 |
* Load is given in academic hour (1 academic hour = 45 minutes)
|
Description:
|
The course introduces formal models of automata and grammars used for description,
definition, software and hardware implementation, as well as verification of correctness of
execution of computer and communication processes, protocols, and systems. Basic
properties of computing processes and systems, such as determinism, decidability,
computability, complexity, and tractability, are explained. Basics of automata theory, formal
grammars, and languages are given. Chomsky hierarchy of languages is presented: regular
languages, context-free languages, context-sensitive languages, recursive languages, and
recursively-enumerable languages. Complexity classes and hierarchy of complexity classes
are defined: complete and hard problems, polynomial classes P and NP, and reduction
method.
|
Literature:
|
- Uvod u teoriju računarstva; S. Srbljić; Element Zagreb; 2007; ISBN: 978-953-197-624-4
- Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography; J. Hromkovic; Springer; 2003; ISBN: 978-3540140153
- Introduction to Automata Theory, Languages, and Computation; J. E. Hopcroft, R. Motwani, J. D. Ullman; Addison-Wesley; 2000; ISBN: 978-0201441246
- An Introduction to Formal Languages and Automata; P. Linz; Jones & Bartlett Publishers; 2000; ISBN: 978-0763714222
- Automata and Computability; D. C. Kozen; Springer; 1997; ISBN: 978-0387949079
|
Prerequisit for:
|
Enrollment:
Passed:
Programming and Software Engineering
|
|
4. semester
|
Full time study
course for
study
Computing
|
|
