13 citations · 18 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.FL2021★ 2 cited
Constructing deterministic -automata from examples by an extension of the RPNI algorithm
León Bohn, Christof Löding
The RPNI algorithm (Oncina, Garcia 1992) constructs deterministic finite automata from finite sets of negative and positive example words. We propose and analyze an extension of th…
cs.FL2021★ 1 cited
Synthesis from Weighted Specifications with Partial Domains over Finite Words
Emmanuel Filiot, Christof Löding, Sarah Winter
In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications. Such systems are modeled as finite transducers whose execution…