Search papers, labs, and topics across Lattice.
Affiliation:
1
0
3
Active learning for deterministic register automata is now polynomial-time solvable across both dense and non-dense ordered domains, unlocking new possibilities in automata theory.
