2 citations · 2 across the 2 of their papers we have counts for
4 papers
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…
Nominal Topology for Data Languages
Fabian Birkmann, Stefan Milius, Henning Urbat
We propose a novel topological perspective on data languages recognizable by orbit-finite nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological space…
Distributed Coalgebraic Partition Refinement
Fabian Birkmann, Hans-Peter Deifel, Stefan Milius
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, a new partition refinement algorithm and associated tool CoPaR were deve…
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…