456-0500/01 – BC Theory of languages and automata (TJAb)

Gurantor departmentDepartment of Computer ScienceCredits8
Subject guarantorprof. RNDr. Petr Jančar, CSc.Subject version guarantorprof. RNDr. Petr Jančar, CSc.
Study levelundergraduate or graduateRequirementChoice-compulsory
YearSemesterwinter
Study languageCzech
Year of introduction1998/1999Year of cancellation2003/2004
Intended for the facultiesFEIIntended for study typesBachelor
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2

Subject aims expressed by acquired skills and competences

Teaching methods

Summary

The course is devoted to some basic parts of theory of automata and languages, with special emphasis on finite automata and context-free languages. The aim of the course is to explain notions, results and methods which are used in various areas of applied informatics (e.g., in pattern searching in texts or in design and realization of compilers), and also to demonstrate usefulness of formalized (abstract) approach for solving (practical) problems.

Compulsory literature:

Recommended literature:

Way of continuous check of knowledge in the course of semester

E-learning

Other requirements

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Přednášky: Uvod ke kursu. Konecny automat. Navrh konecnych automatu. Regularni operace. Nedeterminismus. Vztah deterministickych a nedeterministickych konecnych automatu. Uzaverove tridy regularnich jazyku. Regularni vyrazy a jejich ekvivalence s konecnymi automaty. Minimalni konecne automaty a algoritmus minimalizace. Neregularni jazyky. Pumping lemma pro regularni jazyky. Bezkontextove gramatiky a jazyky, stromy odvozeni, jednoznacnost, uloha syntakticke analyzy. Redukovane gramatiky, Chomskeho normalni forma. Zasobnikove automaty a jejich ekvivalence s bezkontextovymi gramatikami. Uzaverove vlastnosti tridy bezkontextovych jazyku. Deterministicke zasobnikove automaty. Nebezkontextove jazyky. Pumping lemma pro bezkontextove jazyky. Obecne gramatiky, Chomskeho hiearchie. Konecne automaty a regularni gramatiky. Turingovy stroje. Rekurzivni a rekurzivne spocetne jazyky. Linearne omezene automaty a kontextove jazyky. Zaver kursu.

Conditions for subject completion

Full-time form (validity from: 1960/1961 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)		Min. number of pointsMax. počet pokusů
Exercises evaluation and Examination Credit and Examination 100 (145) 51 3
        Examination Examination 100  0 3
        Exercises evaluation Credit 45  0 3
Mandatory attendence participation:

Show history

Conditions for subject completion and attendance at the exercises within ISP:

Show history

Occurrence in study plans

Academic yearProgrammeBranch/spec.Spec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2003/2004 (B2612) Electrical Engineering and Computer Science (1801R001) Computer Science P Czech Ostrava 3 Compulsory study plan
2003/2004 (M2612) Electrical Engineering and Computer Science (2601T004) Measurement and Control Engineering P Czech Ostrava Choice-compulsory study plan
2003/2004 (M2612) Electrical Engineering and Computer Science (2612T018) Electronics and Communication Technology P Czech Ostrava Choice-compulsory study plan
2003/2004 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (10) Elektrické stroje a přístroje P Czech Ostrava Choice-compulsory study plan
2003/2004 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (20) Elektrické pohony a výkonová elektronika P Czech Ostrava Choice-compulsory study plan
2003/2004 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava Choice-compulsory study plan
2003/2004 (M2612) Electrical Engineering and Computer Science (3907T001) Electrical Power Engineering P Czech Ostrava Choice-compulsory study plan
2002/2003 (B2612) Electrical Engineering and Computer Science (1801R001) Computer Science P Czech Ostrava 3 Compulsory study plan
2001/2002 (B2612) Electrical Engineering and Computer Science (1801R001) Computer Science P Czech Ostrava 3 Compulsory study plan
2000/2001 (B2612) Electrical Engineering and Computer Science (1801R001) Computer Science P Czech Ostrava 3 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction

Předmět neobsahuje žádné hodnocení.