Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines
IEEE Transactions on Computers
On the modular decomposition of autonomous sequential machines
SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
Minimum Universal Logic Module Sequential Circuits with Decoders
IEEE Transactions on Computers
| Hi-index | 15.00 |
In this correspondence uniform decomposition procedures are extended to incompletely specified sequential machines. Any given Moore sequential machine is realized by interconnecting copies of a universal two-state component machine. The information processed by each component machine is represented by its corresponding partial mapping. When the sequential machine is incompletely specified, a reduction in the number of component machine copies is possible. The reduction is found by a uniform-cost search algorithm which finds a minimal cover on the set of partial mappings.