Seminarium Teoria Automatów

Prelegent: Mikolaj Bojanczyk (joint with Igor Walukiewicz)

I will present an algebra for recognizing languages of unranked, finite trees. This algebra is a special case of a transformation semigroup. The talk will focus on analyzing algebras that correspond to languages defined in logic (for instance, first-order logic)