Sequential Machines, Ambiguity, and Dynamic Programming
- 1 January 1960
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 7 (1) , 24-28
- https://doi.org/10.1145/321008.321011
Abstract
Given a sequential machine, in the terminology of E. F. Moore, Annals of Mathematics Studies, No. 34, 1956, a problem of some interest is that of determining testing procedures which will enable one to transform it into a known state starting from an initial situation in which only the set of possible states is given. To treat this problem, we introduce the concept of ambiguity, and show how the functional equation approach of dynamic programming can be applied.Keywords
This publication has 2 references indexed in Scilit:
- On an Application of Dynamic Programming to the Synthesis of Logical SystemsJournal of the ACM, 1959
- A method for synthesizing sequential circuitsBell System Technical Journal, 1955