Automata and Semi-Groups 1000-2M05AG
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)
Type of course
Bibliography
1.Howard Straubing, Finite Automata, Formal Logic and Circuit Complexity, Birkahauser 1994
Additional information
Information on level of this course, year of study and semester when the course unit is delivered, types and amount of class hours - can be found in course structure diagrams of apropriate study programmes. This course is related to the following study programmes:
- Bachelor's degree, first cycle programme, Computer Science
- Master's degree, second cycle programme, Computer Science
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: