The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue). If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.
The seminar is open to public and does not require any form of registration.
The star-height problem for regular word languages is to determine for a given regular language the minimal number of nestings of Kleene-stars required in a regular expression defining the given language. We consider the corresponding problem for regular tree languages and show that this problem is decidable. We do this by adapting a proof method that was used by Daniel Kirsten to the setting of trees.