2 citations · 2 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Learning DFAs from Positive Examples Only via Word Counting
Benjamin Bordais, Daniel Neider
Learning finite automata from positive examples has recently gained attention as a powerful approach for understanding, explaining, analyzing, and verifying black-box systems. The…
cs.CC2021★ 2 cited
Anti-unification of Unordered Goals
Gonzague Yernaux, Wim Vanhoof
Anti-unification in logic programming refers to the process of capturing common syntactic structure among given goals, computing a single new goal that is more general called a gen…