Automata and Semi-Groups

General data

Course ID:	1000-2M05AG
Erasmus code / ISCED:	11.303 Kod klasyfikacyjny przedmiotu składa się z trzech do pięciu cyfr, przy czym trzy pierwsze oznaczają klasyfikację dziedziny wg. Listy kodów dziedzin obowiązującej w programie Socrates/Erasmus, czwarta (dotąd na ogół 0) – ewentualne uszczegółowienie informacji o dyscyplinie, piąta – stopień zaawansowania przedmiotu ustalony na podstawie roku studiów, dla którego przedmiot jest przeznaczony. / (0612) Database and network design and administration The ISCED (International Standard Classification of Education) code has been designed by UNESCO.
Course title:	Automata and Semi-Groups
Name in Polish:	Automaty a półgrupy
Organizational unit:	Faculty of Mathematics, Informatics, and Mechanics
Course groups:	(in Polish) Przedmioty obieralne na studiach drugiego stopnia na kierunku bioinformatyka Elective courses for Computer Science
ECTS credit allocation (and other scores):	(not available) Basic information on ECTS credits allocation principles: the annual hourly workload of the student’s work required to achieve the expected learning outcomes for a given stage is 1500-1800h, corresponding to 60 ECTS; the student’s weekly hourly workload is 45 h; 1 ECTS point corresponds to 25-30 hours of student work needed to achieve the assumed learning outcomes; weekly student workload necessary to achieve the assumed learning outcomes allows to obtain 1.5 ECTS; work required to pass the course, which has been assigned 3 ECTS, constitutes 10% of the semester student load. view allocation of credits
Language:	English
Type of course:	elective monographs
Short description:	Elements of the theory of semigroups with applications in the theory of formal languages. Languages defined using logical methods.
Full description:	1. Elements of semigroups. Connections with regular languages. Green's relations (2-3 lectures) 2. Simon Theorem on factorisation forests (1 lecture) 3. Schutzenberger theorem on star-free languages (1-2 lectures) 4. Temporal logics (2 lectures) 5. Infinite words (3 lectures) 6. Trees (3 lectures)
Bibliography:	1.Howard Straubing, Finite Automata, Formal Logic and Circuit Complexity, Birkahauser 1994

This course is not currently offered.

Course descriptions are protected by copyright.
Copyright by University of Warsaw.