Shortest path problems and tree grammars: An algebraic framework

1. Goguen, J.A.,Thatcher, J.W.,Wagner, E.G. and Wright, J.B., Initial Algebra Semantics and Continuous Algebras.J.Assoc.Comput.Mach.24, 1977, 68–95.

   Google Scholar 

2. Arnold,A. and Nivet,M., Non Deterministic Recursive Program Schemes, Fundamentals of Computation Theory 1977,Lecture notes in Computer Science no56, Springer Verlag (1977), 12–21.

   Google Scholar 

3. Martelli,A. and Montanari, U., Optimizing Decision Trees Through Heuristically Guided Search, Technical Report S-77-33, Computer Science Dept., Univ.of Pisa; also Comm.of the ACM, in press.

   Google Scholar 

4. Engelfriet, J. and Schmidt, E.M., IO and OI, Daimi Report PB 47, University of Aarhus, Danmark (1975).

   Google Scholar 

5. Bellman, R.E., Dynamic Programming, Princeton University Press, Princeton, N.J. 1957.

   Google Scholar 

6. Karp, R.M. and Held, M., Finite State Processes and Dynamic Programming, SIAM J.Appl. Math., 15, 1957.

   Google Scholar 

7. Martelli, A. and Montanari,U., On the Foundation of Dynamic Programming, Topics in Combinational Optimization (S.Rinaldi ed.), Springer Verlag, 1975, 145–163.

   Google Scholar 

8. Martelli,A. and Montanari,U., Programmazione Dinamica e Punto Fisso, Atti del Convegno di Informatica Teorica, Mantova, November 1974.

   Google Scholar 

9. Knuth, D.E., A Generalization of Dijkstra's Algorithm, Information Processing Letters, February 1977, 1–4.

   Google Scholar 

10. Martelli,A. and Montanari, U., From Dynamic Programming to Search Algorithms with Functional Costs, Proc.Fourth Int.Joint Conf.on Artificial Intelligence, Tbilisi, September 1975, 345–350.

    Google Scholar 

Download references