AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Learning DFAs from Positive Examples Only via Word Counting

Benjamin Bordais, Daniel Neider

AAAI 2026 · Learning theory and algorithms › Prediction and decision losses · approach: Active learning and subset selection · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
solve the word-counting task with an ILP encoding instead of the symbolic SAT-based algorithmILP algorithm (Gurobi) · 28 samples, n=4 and n=6 runtimeruntimeHurt
start the symbolic algorithm from a DFA found by the word-counting heuristic (symbolic*)symbolic algorithm · 10 hard samples (runtime >= 500s, n=8 except sample 08 n=7)runtimeMixed
run heuristic+symbolic* in a portfolio with the symbolic algorithmsymbolic algorithm · 10 hard samples (runtime >= 500s)runtimeImproved
lower the starting score of the initial DFA given to the symbolic algorithmsymbolic* algorithm · samples with n=8runtime ratioMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy