Languages of infinite and profinite words
- Speaker(s)
- Szymon Toruńczyk
- Affiliation
- Uniwersytet Warszawski
- Date
- Nov. 10, 2010, 2:15 p.m.
- Room
- room 5870
- Seminar
- Seminar Automata Theory
I will present connections between three classes of objects:
1) languages of infinite words, such as B- and S-regular languages defined by Mikolaj Bojańczyk and Thomas Colcombet
2) regular cost functions, defined by Thomas Colcombet
3) languages of profinite words
I will introduce the corresponding notions and discuss the interplay between them.