FC-Datalog as a framework for efficient string querying
From MaRDI portal
Cites work
- A logic for document spanners
- Alternating multihead finite automata
- Complexity of Makanin's algorithm
- Deterministic regular expressions with back-references
- Document spanners: a formal approach to information extraction
- Document spanners: from expressive power to decision problems
- Efficient testing and matching of deterministic regular expressions
- Elements of finite model theory.
- Finding patterns common to a set of strings
- Graph logics with rational relations: the role of word combinatorics
- scientific article; zbMATH DE number 996385 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Languages generated by conjunctive query fragments of FC[REG]
- On the complexity of single-rule datalog queries.
- Recursive Programs for Document Spanners
- Regular expressions into finite automata
- Sequences, datalog, and transducers
- Splitting spanner atoms: a tool for acyclic core spanners
- THE ABSTRACT THEORY OF AUTOMATA
- The expressibility of languages and relations by word equations
- The theory of concatenation over finite models
- Word equations in nondeterministic linear space
This page was built for publication: FC-Datalog as a framework for efficient string querying
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292799)
