University of Warsaw - Central Authentication System

Infinite alphabets

General data

Course ID:	1000-2M16AN
Erasmus code / ISCED:	11.3 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:	Infinite alphabets
Name in Polish:	Alfabety nieskończone
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):	6.00 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
Full description:	The first part of the course is devoted to automata in which despite of the fact that the alphabet is infinite it is augmented with some structure (e.g. order or equality). Examples or accepted languages are `all symbols are different', `the order on letters increases', `there are two equal symbols'. The second part of the course is devoted to a more abstract theory, in which algorithms operate on infinite objects (such as the set of rationals) under condition that they have a finite description. Programme: 1. Register automata 2. Automata checking for non-emptiness that use well-quasi orders and vector addition systems 3. Orbint-finite sets 4. Elements of model theory – oligomorphic and homogenic structures 5. Algorithms operating on orbit-finite sets
Bibliography:	Slightly infinite sets. Mikołaj Bojańczyk https://www.mimuw.edu.pl/~bojan/upload/main-2.pdf
Learning outcomes:	The knowledge of infinite state systems and their connections with model theory.
Assessment methods and assessment criteria:	oral exam & homework assignments with star

Classes in period "Summer semester 2024/25" (future)

Time span:	2025-02-17 - 2025-06-08	Selected timetable range: weekly course term Navigate to timetable
Type of class:	Classes, 30 hours more information Lecture, 30 hours more information
Coordinators:	Mikołaj Bojańczyk
Group instructors:	Mikołaj Bojańczyk, Michał Skrzypczak
Students list:	(inaccessible to you)
Examination:	Examination

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