Regular Languages - A Descriptional Complexity Perspective
Luca Prigioniero
Finite automata are well-known classical models that recognise regular languages. However, many other devices characterising this class exist. These alternative formalisms may represent languages in a significantly more concise way than classical recognisers. In this seminar I will present an overview of old and recent results on formal systems for regular languages from a descriptional complexity point of view, that is by considering the relationships between the sizes of such devices.
Contact and booking details
- Booking required?
- No