Infinite alphabets
General data
Course ID: | 1000-2M16AN |
Erasmus code / ISCED: |
11.3
|
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
|
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 |
Navigate to timetable
MO TU W TH FR |
Type of class: |
Classes, 30 hours
Lecture, 30 hours
|
|
Coordinators: | Mikołaj Bojańczyk | |
Group instructors: | Mikołaj Bojańczyk, Michał Skrzypczak | |
Students list: | (inaccessible to you) | |
Examination: | Examination |
Copyright by University of Warsaw.