4 citations · 5 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
From Generic Partition Refinement to Weighted Tree Automata Minimization
Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius +1
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in th…
cs.DS2018
Generic Partition Refinement and Weighted Tree Automata
Hans-Peter Deifel, Stefan Milius, Lutz Schröder +1
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in th…