111 citations · 528 across the 50 of their papers we have counts for
3 papers · 1 filter
A Coinductive Treatment of Infinitary Rewriting
Joerg Endrullis, Helle Hvid Hansen, Dimitri Hendriks +2
We introduce a coinductive definition of infinitary term rewriting. The setup is surprisingly simple, and has in contrast to the usual definitions of infinitary rewriting, neither…
Automatic Equivalence Proofs for Non-deterministic Coalgebras
Marcello Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac +3
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed by a…
Generalizing determinization from automata to coalgebras
Alexandra Silva, Filippo Bonchi, Marcello Bonsangue +1
The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powers…