Learning unions of \(k\)-testable languages
From MaRDI portal
Publication:2278288
DOI10.1007/978-3-030-13435-8_24zbMath1425.68150arXiv1812.08269OpenAlexW2905262761MaRDI QIDQ2278288
Alexis Linard, Colin de la Higuera, Frits W. Vaandrager
Publication date: 4 December 2019
Full work available at URL: https://arxiv.org/abs/1812.08269
Computational learning theory (68Q32) Formal languages and automata (68Q45) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
This page was built for publication: Learning unions of \(k\)-testable languages