3 papers
cs.AI2026
A canonical generalization of OBDD
Florent Capelli, YooJung Choi, Stefan Mengel +2
We introduce Tree Decision Diagrams (TDD) as a model for Boolean functions that generalizes OBDD. They can be seen as a restriction of structured d-DNNF; that is, d-DNNF that respe…
cs.DS2026
Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
Martín Muñoz
We present an algorithm that, given an index , produces the -th (lexicographically ordered) answer of an MSO query over a string. The algorithm requires linear-time preproces…
cs.LG2025
Active Learning of Symbolic Automata Over Rational Numbers
Sebastian Hagedorn, Martín Muñoz, Cristian Riveros +1
Automata learning has many applications in artificial intelligence and software engineering. Central to these applications is the algorithm, introduced by Angluin. The …