1 citations · 1 across the 3 of their papers we have counts for
11 papers
Coalgebraic Semantics for Nominal Automata
Florian Frank, Stefan Milius, Henning Urbat
This paper provides a coalgebraic approach to the language semantics of two types of non-deterministic automata over nominal sets: non-deterministic orbit-finite automata (NOFAs) a…
Stateful Structural Operational Semantics
Sergey Goncharov, Stefan Milius, Lutz Schröder +2
Compositionality of denotational semantics is an important concern in programming semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees composit…
Nominal Büchi Automata with Name Allocation
Henning Urbat, Daniel Hausmann, Stefan Milius +1
Infinite words over infinite alphabets serve as models of the temporal development of the allocation and (re-)use of resources over linear time. We approach omega-languages over in…
Nondeterministic Syntactic Complexity
Robert Myers, Stefan Milius, Henning Urbat
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the `canonical boolean representation' of t…
Reiterman's Theorem on Finite Algebras for a Monad
Jiri Adamek, Liang-Ting Chen, Stefan Milius +1
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e.~cla…
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…