Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Tarski, A., A Lattice-Theoretical Fixpoint Theorem and its Applica tions, Pacific J. of Math. 5, pp. 285–309.
Karp, R.M. and Held, M., Finite - State Processes and Dynamic Programming, SIAM J. Appl. Math. 15, 1967, pp.
Salomaa, A., Theory of Automata Pergamon Press, 1969.
Backhouse, R.C. and Carré, B.A., Regular Algebra Applied to Path--Finding Problems, to appear in J. Inst. Maths. Applics.
Dijkstra, E., A Note on Two Problems in Connection with Graphs, Numerische Math. 1, 1959, pp. 269–271.
Haines, L.H., On Free Monoids Partially Ordered by Embedding, J. Comb. Theory 6, 1969, pp. 94–98.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martelli, A., Montanari, U. (1974). Dynamic Programming Schemata. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-21545-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06841-9
Online ISBN: 978-3-662-21545-6
eBook Packages: Springer Book Archive