Dynamic programming schemata
In this paper we give a model of dynamic programming based on functional equations. A general method for solving these equations, based on the fixpoint theory for lattices, is given. Furthermore it is shown that a dynamic programming problem can be formulated in a suitable regular algebra and the system can be solved using Gaussian elimination.
A dynamic programming problem can be posed independently of the particular values of functions and constants. Therefore, we introduce three types of dynamic programming schemata. Equivalence of schemata is defined and investigated, and necessary and sufficient conditions are given for the case of positively monotone interpretations.
KeywordsDynamic Programming Transition Schema Regular Language Transition Graph Expression Schema
Unable to display preview. Download preview PDF.
- Martelli, A. and Montanari, U., On the Foundations of Dynamic Programming, in Topics in Combinatorial Optimization, S. Rinaldi editor, CISM, Springer Verlag 1974, to appear.Google Scholar
- Tarski, A., A Lattice-Theoretical Fixpoint Theorem and its Applications, Pacific J. of Math., 5, pp. 285–309.Google Scholar
- Salomaa, A., Theory of Automata, Pergamon Press, 1969.Google Scholar
- Backhouse, R.C. and Carré, B.A., Regular Algebra Applied to Path-Finding Problems, to appear in J. Inst. Maths. Applics.Google Scholar
- Haines, L.H., On Free Monoids Partially Ordered by Embedding, J. Comb. Theory, 6, 1969, pp. 94–98.Google Scholar