2 papers
cs.FL2025
On the Complexity of Language Membership for Probabilistic Words
Antoine Amarilli, Mikaël Monet, Paul Raphaël +1
We study the membership problem to context-free languages (CFLs) on probabilistic words, that specify for each position a probability distribution on the letters. Our task is to co…
cs.DB2023
Direct Access for Conjunctive Queries with Negations
Florent Capelli, Nofar Carmeli, Oliver Irwin +1
Given a conjunctive query and a database , a direct access to the answers of over is the operation of returning, given an index , the -th answer for some order…