2 papers
cs.LO2026
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…
cs.LO2026
A cartesian closed fibration of higher-order regular languages
Paul-André Melliès, Vincent Moreau
We explain how to construct in two different ways a cartesian closed fibration of higher-order regular languages in the sense of Salvati. In the first construction, we use fibratio…