4 citations · 5 across the 2 of their papers we have counts for
Showing cs.FLShow all
3 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.FL2021★ 1 cited
Minimality Notions via Factorization Systems
Thorsten Wißmann
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary…
cs.FL2018
Path category for free - Open morphisms from coalgebras with non-deterministic branching
Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata +1
There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span…