An L#-inspired active learning algorithm learns minimal separating DFAs for disjoint languages when one exists and outperforms prior methods on random and industrial benchmarks.
In: 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
An L#-inspired active learning algorithm learns minimal separating DFAs for disjoint languages when one exists and outperforms prior methods on random and industrial benchmarks.