1 citations · 1 across the 1 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2022★ 1 cited
Learning from Positive and Negative Examples: New Proof for Binary Alphabets
Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf
One of the most fundamental problems in computational learning theory is the the problem of learning a finite automaton consistent with a finite set of positive examples an…
cs.FL2021
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann +4
In the Intersection Non-Emptiness problem, we are given a list of finite automata over a common alphabet as input, and the goal is to determine whether some…