Showing cs.FLShow all
2 papers · 1 filter
cs.FL2024
Algebraic Language Theory with Effects
Fabian Lenke, Stefan Milius, Henning Urbat +1
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the o…
cs.FL2020
On Language Varieties Without Boolean Operations
Fabian Birkmann, Stefan Milius, Henning Urbat
Eilenberg's variety theorem marked a milestone in the algebraic theory of regular languages by establishing a formal correspondence between properties of regular languages and prop…