10 citations · 17 across the 8 of their papers we have counts for
4 papers · 1 filter
A simple algorithmic framework for disambiguation of finite automata
Mauricio Cari, Martín Muñoz, Cristian Riveros
We study the task of disambiguation of finite state automata, namely, converting an automaton into an equivalent, unambiguous one. We do this by developing a novel and simple algor…
Earliest query answering over streamed trees
Mateusz Gienieczko, Martín Muñoz, Filip Murlak +1
Streaming allows executing queries over massive JSON or XML documents whose size makes it infeasible to fully parse them into a tree. Earliest query answering is a radical approach…
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…
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…