Quentin Aristote

Active Learning of Upward-Closed Sets of Words

2025 · arXiv (Cornell University)

We give a new proof of a result from well quasi-order theory on the computability of bases for upwards-closed sets of words. This new proof is based on Angluin's L* algorithm, that learns an automaton …