Sequences, datalog, and transducers
From MaRDI portal
Publication:1278034
DOI10.1006/jcss.1998.1562zbMath0917.68053OpenAlexW2058241717MaRDI QIDQ1278034
Giansalvatore Mecca, Anthony J. Bonner
Publication date: 8 August 1999
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1998.1562
Related Items (8)
Structural recursion as a query language on lists and ordered trees ⋮ Using acceptors as transducers ⋮ Document Spanners ⋮ Reasoning about strings in databases ⋮ Pattern Unification with Sequence Variables and Flexible Arity Symbols ⋮ Transducing Markov sequences ⋮ Computing possible and certain answers over order-incomplete data ⋮ Cut and paste
Uses Software
Cites Work
- Hypothetical datalog: Complexity and expressibility
- A new recursion-theoretic characterization of the polytime functions
- LOGIDATA+: deductive databases with complex objects
- A lattice-theoretical fixpoint theorem and its applications
- Temporal logic can be more expressive
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sequences, datalog, and transducers