Reasoning about Strings in Databases
- 1 August 1999
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 59 (1) , 116-162
- https://doi.org/10.1006/jcss.1999.1633
Abstract
No abstract availableKeywords
Funding Information
- Academy of Finland (22856)
This publication has 21 references indexed in Scilit:
- Non-deterministic two-tape automata are more powerful than deterministic onesPublished by Springer Nature ,2005
- Similarity-based queriesPublished by Association for Computing Machinery (ACM) ,1995
- Domain independence and the relational calculusActa Informatica, 1994
- Reasoning about strings in databasesPublished by Association for Computing Machinery (ACM) ,1994
- Finite State Automata from Regular Expression TreesThe Computer Journal, 1993
- Safety and translation of calculus queries with scalar functionsPublished by Association for Computing Machinery (ACM) ,1993
- Pattern matching by Rs-operationsPublished by Association for Computing Machinery (ACM) ,1992
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- Multi-tape and multi-head pushdown automataInformation and Control, 1968
- Mappings of languages by two-tape devicesJournal of the ACM, 1965