Reasoning about strings in databases
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3976379 (Why is no real title available?)
- scientific article; zbMATH DE number 193480 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Absolutely parallel grammars and two-way finite-state transducers
- Domain independence and the relational calculus
- Mappings of languages by two-tape devices
- Multi-tape and multi-head pushdown automata
- On the lengths of values in a finite transducer
- On the valuedness of finite transducers
- Sequences, datalog, and transducers
- String variable grammar: A logic grammar formalism for the biological language of DNA
- Temporal logic can be more expressive
- The polynomial-time hierarchy
- Time-space-optimal string matching
Cited in
(6)- Approximate pattern matching and transitive closure logics.
- scientific article; zbMATH DE number 2080401 (Why is no real title available?)
- Definable relations and first-order query languages over strings
- Design and implementation of a string database query language.
- A formal framework for stringology
- Using acceptors as transducers
This page was built for publication: Reasoning about strings in databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807679)
