Profinite trees, through Lawvere theories and the lambda-calculus

Vincent Moreau

The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a…