## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

A little over 50 years ago (1962), we had the first nontrivial theorem which used an algebraic approach to automata theory: Schuetzenberger's theorem giving an algorithm to check whether a given regular language is definable using a starfree expre