Giansalvatore Mecca
- 1.S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Comp. and Syst. Sci., 43(1), 1991. Google Scholar
Digital Library
- 2.A. Albano, L. Cardelli and R. Orsini. Galileo: A strongly typed language for complex objects. In A CM rODS, 10(2), 1985. Google ScholarDigital Library
- 3.M. Atkinson, F. Bancilhon, D. DeWitt, K. Dittrich, D. Maier and Z. Zdonik. The object oriented database manifesto. In DOOD, 1989.Google Scholar
- 4.P. Atzeni, editor. LOGIDATA-I-: Deductive Databases with Complex Objects. L NCS 701- Springer-Verlag, 1993. Google ScholarDigital Library
- 5.F. Bancilhon, S. Cluet and C. Delobel. A query language for the 02 object-oriented database system. In DBPL, 1989. Google ScholarDigital Library
- 6.S. Bellantoni and S. Cook. A new recursiontheoretic characterization of the polytime functions, in A CM STOC, 1992. Google ScholarDigital Library
- 7.A. J. Bonner. Hypothetical Datalog: complexity and expressibility. Theoretical Computer Science, 76, 1990. Google ScholarDigital Library
- 8.V. Breazu-Tannen, P. Buneman and L. Wong. Naturally embedded query languages. In ICDT, 1992.Google ScholarCross Ref
- 9.A. K. Chandra and D. Harel. Computable queries for relational databases. Journal of Comp. and Syst. Sci. , 21, 1980.Google Scholar
- 10.L. S. Colby, E. L. Robertson, L. V. Saxton and D. Van Gucht. A query language for list based complex objects. In A CM PODS, 1994. Google ScholarDigital Library
- 11.Communications of the A CM. Special issue on the Human Genome project, vol.34, n.ll. November 1991.Google Scholar
- 12.S. Ginsburg and X. Wang. Pattern matching by RS-Operations: Towards a unified approach to querying sequenced data. In ACM PODS, 1992. Google ScholarDigital Library
- 13.G. H. Gonnet. Text dominated databases: Theory, practice and experience. Tutorial presented at A CM PODS, 1994. Google ScholarDigital Library
- 14.G. Grahne, M. Nykanen and E. Ukkonen. Reasoning about strings in databases. In A CM PODS, 1994. Google ScholarDigital Library
- 15.S. Grumbach and T. Milo. An algebra for POMSETS. In ICDT, 1995. Google ScholarDigital Library
- 16.C. Hegelsen and P. R. Sibbald. PALM - A pattern language for molecular biology. In Proc. First Int. Conf. on Intellzgent Systems for Molecular Biology (ISMB), 1993. Google ScholarDigital Library
- 17.R. Hull and J. Su. On the expressive power of database queries with intermediate types. Journal of Comp. and System Sc., 43(1), 1991. Google ScholarDigital Library
- 18.N. Immerman. Relational queries computable in polynomial time. Information and Control, 68, 1986. Google ScholarDigital Library
- 19.N. Immerman, S. Patnaik and D. Stemple. The expressiveness of a family of finite set languages. In A CM PODS, 1991. Google ScholarDigital Library
- 20.J. W. Lloyd. Foundations of Logic Programming, Second Edition. Springer-Verlag, 1987. Google ScholarDigital Library
- 21.G. Mecca and A. J. Bonner. Generalized Sequence Transducers. In preparation. 1995.Google Scholar
- 22.G. Mecca and A. J. Bonnet. Sequences, Datalog and Transducers. Technical Report. In preparation. 1995.Google Scholar
- 23.C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- 24.J. Richardson. Supporting lists in a data model (A timely approach). In VLDB, 1992. Google ScholarDigital Library
- 25.D. B. Searls. String Variable Grammars: a logic grammar formalism for DNA sequences. Tech. Report, University of Pennsylvania School of Medicine, 1993.Google Scholar
- 26.D. Stott Parker, E. Simon and P. Valduriez. SVP - a model capturing sets, streams and parallelism. In VLDB, 1992. Google ScholarDigital Library
- 27.The Committee for Advanced DBMS functions. Third-generation database system manifesto. In SIGMOD Record, 19(3), 1990. Google ScholarDigital Library
- 28.S. Vandenberg and D. De Witt. Algebraic support for complex objects with arrays, identity and inheritance. In ACM SIGMOD, 1991. Google ScholarDigital Library
- 29.M. Vardi. The complexity of relational query languages. In ACM STOC, 1982. Google ScholarDigital Library
- 30.X. Wang. Pattern matching by RS-Operations: towards a unified approach to querying sequenced data. PhD Dissertation, University of Southern California, 1992. Google ScholarDigital Library
- 31.J.D. Watson, et aI. Molecular Biology of the Gene, Fourth Edition. Benjamin/Cummings Publishing Company, 1987.Google Scholar
- 32.P. Wolper. Temporal logic can be more expressive. Information and Control, 56, 1983.Google Scholar
Index Terms
- Sequences, Datalog and transducers
Recommendations
Sequences, Datalog, and Transducers
Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systemsThis paper develops a query language for sequence databases, such as genome databases and text databases. The language, calledSequence Datalog, extends classical Datalog with interpreted function symbols for manipulating sequences. It has both a clear ...
Visibly Pushdown Automata and Transducers with Counters
Non-Classical Models of Automata and Applications VIWe generalize the models of visibly pushdown automata (VPDAs) and visibly pushdown transducers (VPDTs) by equipping them with reversal-bounded counters. We show that some of the results for VPDAs and VPDTs (e.g., closure under intersection and ...
Properties of visibly pushdown transducers
MFCS'10: Proceedings of the 35th international conference on Mathematical foundations of computer scienceVisibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. It has been shown that visibly ...
Comments