Solving regular path queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2386, Issue , 2002, Pages 195-208

  Liu, Yanhong A ^a   Yu, Fuxiang ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; HIGH LEVEL LANGUAGES; PATTERN MATCHING; QUERY LANGUAGES; REGRESSION ANALYSIS; SPECIFICATIONS;

ALGORITHMIC SOLUTIONS; DETERMINISTIC FINITE AUTOMATA; DOMINATED CONVERGENCE; GRAPH REPRESENTATION; REAL TIME SIMULATIONS; REGULAR EXPRESSIONS; REGULAR PATH QUERIES; TIME AND SPACE COMPLEXITY;

APPLICATION PROGRAMS;

EID: 84959040988     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45442-X_12     Document Type: Conference Paper

References (18)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, Mass., 1983.
2. J. Cai, P. Facon, F. Henglein, R. Paige, and E. Schonberg. Type analysis and data structure selection. In B. Möller, editor, Constructing Programs from Specifications, pages 126–164. North-Holland, Amsterdam, 1991.
3. J. Cai and R. Paige. Program derivation by fixed point computation. Sci. Comput. Program., 11:197–261, Sept. 1988/89.
4. C.-H. Chang and R. Paige. From regular expressions to DFA’s using compressed NFA’s. Theoret. Comput. Sci., 178(1-2):1–36, May 1997.
5. O. de Moor, D. Lacey, and E. V. Wyk. Universal regular path queires, Nov. 2001. Revised and beingrev iewed for Special Issue of Higher-Order and Symbolic Computation dedicated to Bob Paige.
6. D.-Z. Du and K.-I. Ko. Theory of Computational Complexity. John Wiley & Sons, 2000.
7. Y. A. Liu. Efficiency by incrementalization: An introduction. Higher-Order and Symbolic Computation, 13(4):289–313, Dec. 2000.
8. Z. Manna and R. Waldinger. The Deductive Foundations of Computer Programming. Addison-Wesley, Reading, Mass., 1993.
9. M. Müller-Olm, D. Schmidt, and B. Steffen. Model-checking: A tutorial introduction. In Proceedings of the 6th International Static Analysis Symposium, volume 1694 of Lecture Notes in Computer Science, pages 331–354. Springer-Verlag, Berlin, Sept. 1999.
10. R. Paige. Formal Differentiation: A Program Synthesis Technique, volume 6 of Computer Science and Artificial Intelligence. UMI Research Press, Ann Arbor, Michigan, 1981. Revision of Ph.D. dissertation, New York University, 1979.
11. R. Paige. Programming with invariants. IEEE Software, 3(1):56–69, Jan. 1986.
12. R. Paige. Real-time simulation of a set machine on a RAM. In Computing and Information, Vol. 2, pages 69–73. Canadian Scholars Press, 1989. Proceedings of ICCI’89: The International Conference on Computingan d Information, Toronto, Canada, May 23-27, 1989.
13. R. Paige. Viewing a program transformation system at work. In M. Hermenegildo and J. Penjam, editors, Proceedings of Joint 6th International Conference on Programming Languages: Implementations, Logics and Programs and 4th International Conference on Algebraic and Logic Programming, volume 844 of Lecture Notes in Computer Science, pages 5–24. Springer-Verlag, Berlin, Sept. 1994.
14. R. Paige and S. Koenig. Finite differencing of computable expressions. ACM Trans. Program. Lang. Syst., 4(3):402–454, July 1982.
15. J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, Berlin, New York, 1986.
16. W. K. Snyder. The SETL2 Programming Language. Technical report 490, Courant Institute of Mathematical Sciences, New York University, Sept. 1990.
17. R. E. Tarjan. Fast algorithms for solving path problems. J. ACM, 28(3):594–614, July 1981.
18. R. E. Tarjan. A unified approach to path problems. J. ACM, 28(3):577–593, July 1981.