Showing cs.LOShow all
3 papers · 1 filter
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…
cs.LO2024
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.LO2023
Syntactically and semantically regular languages of lambda-terms coincide through logical relations
Vincent Moreau, Lê Thành Dũng Nguyên
A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of…