Search Results for author:
Found 2 papers, 0 papers with code
Dynamic Membership for Regular Languages
We show that the problem is in O(log log |w|) for languages in an algebraically-defined, decidable class QSG, and that it is in O(1) for another such class QLZG.
Formal Languages and Automata Theory Data Structures and Algorithms
Reasoning about disclosure in data integration in the presence of source constraints
Data integration systems allow users to access data sitting in multiple sources by means of queries over a global schema, related to the sources via mappings.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
