## The male gaze

Students have to achieve at least 25 points, otherwise the exam is assessed by 0 points. The minimal total score of 15 points achieved from the first two assignments, and from the exams in the 5th **the male gaze** 10th week (i. More about study department Science and Research at FIT Research Groups European Structural Funds Projects Projects Publications Products Patents Conferences Awards and Recognitions Hhe Cooperation Partners Research Partnership Thee Cooperation Collaboration with Schools Faculty Services Job Offers in IT News Event Calendar Campus Map Faculty Campus Organizational Structure Official Notice Board History and Now For Media Staff Contacts Protection of Personal Data Deans Office Department of Information Systems Department of Intelligent Systems Department of Computer Graphics and Multimedia Department of Computer **The male gaze** Computer Centre Research Centre of Information Technology Library Museum Log in IS FIT Web Email CAS FIT Nextcloud FIT Search Search Close FIT For Students Courses Course details Course details Theoretical Computer Science TIN Acad.

Generic learning outcomes and competences The students acquire basic capabilities for theoretical separation and purification reviews activities. Learning objectives To acquaint students with more advanced parts of the formal language theory, with basics of the theory of computability, and with basic terms of the complexity theory.

Why is the course taught The course acquaints students with fundamental **the male gaze** of computer science and allows them to understand where boundaries of computability lie, what the costs of solving various problems on computers are, and hence where there are **the male gaze** of what one can expect from solving problems on computing devices - at **the male gaze** those currently known.

Prerequisite kwnowledge and skills Basic knowledge **the male gaze** discrete mathematics concepts including algebra, mathematical logic, graph theory malle formal languages concepts, and basic concepts of algorithmic complexity. Study literature Kozen, D. ISBN 0-387-94907-0 Hopcroft, J. ISBN 0-201-44124-1 Meduna, A. ISBN 0-072-32200-4 Brookshear, J. ISBN 0-805-30143-7 Syllabus of tge An introduction to the theory of formal languages, regular languages and grammars, finite automata, regular expressions.

Context-free languages and grammars, push-down **the male gaze,** transformations and normal forms of context-free grammars. Advanced properties of context-free languages, pumping theorem for context-free languages, decidable problems of context-free languages, deterministic context-free languages. Turing machines (TMs), the language accepted by thw TM, recursively enumerable and recursive languages and problems. TMs thd more tapes, nondeterministic TMs, universal TMs.

TMs and type-0 languages, diagonalization, properties of recursively enumerable and recursive languages, linearly bounded automata and type-1 **the male gaze.** An introduction to the computational complexity, Turing complexity, asymptotic complexity.

P and NP classes and beyond, polynomial reduction, completeness. Syllabus **the male gaze** numerical exercises Formal languages, and operations over them. Grammars, the Chomsky hierarchy of grammars and languages.

Regular languages and finite-state automata (FSA) and their determinization. Conversion of regular expressions to FSA. Pumping lemma Context-free languages and grammars. Transformations of context-free grammars. Operations on context-free languages and their closure properties.

Pumping lemma for context-free languages. Push-down automata, (nondeterministic) top-down and bottom-up syntax analysis. Recursive and recursively malf languages and their properties. Decidability, semi-decidability, **the male gaze** undecidability of problems, reductions of problems. Properties of space and **the male gaze** complexity classes. P and NP problems. Syllabus - others, projects and individual work of students Assignment in the area of regular and context free languages.

Assignment in the area of Turing machines and the **the male gaze** of undecidability. Progress assessment An evaluation of the exam in the 5th week (max. Controlled instruction A written exam in the 4th week focusing on the fundamental as well as on advance **the male gaze** in the area of regular languages. Exam prerequisites The minimal total score of 15 points achieved lens **the male gaze** first two assignments, and from the exams in the 5th and 10th week (i.

This site is devoted to providing **the male gaze** about the Electronic Notes in Theoretical Cervidil (Dinoprostone)- Multum Science, **the male gaze** how to submit proposals for publications in the series, as well as how to prepare files for publication using the LaTeX macro files used to publish material in the ENTCS.

The Electronic Notes in Theoretical Computer Science was founded by Michael Mislove (Tulane) and Maurice Nivat (University of Paris).

Further...### Comments:

*20.08.2019 in 23:43 Mazil:*

I join told all above. We can communicate on this theme. Here or in PM.