|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| W.F. Cutlip, "R70-14 Some Results on Cascade Decomposition of Automata," IEEE Transactions on Computers, vol. 19, no. 6, pp. 565, June, 1970. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.222985, author = {W.F. Cutlip}, title = {R70-14 Some Results on Cascade Decomposition of Automata}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {6}, issn = {0018-9340}, year = {1970}, pages = {565}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.222985}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - R70-14 Some Results on Cascade Decomposition of Automata IS - 6 SN - 0018-9340 SP EP EPD - 565 A1 - W.F. Cutlip, PY - 1970 KW - null VL - 19 JA - IEEE Transactions on Computers ER - | |||
This paper is based on the following idea. If the two residues xi ? f(x) and } x?i ? f(x) are realizable, respectively, with p and q threshold gates, then f is realizable with at most p+q gates. And conversely, if the residues require separately at least r gates, then so does f. Thus, given a table of minimal realizations for 4-argument functions (which require at most three gates), realizations for 5-argument functions can be obtained which are demonstrably minimal or close to it, by considering the five different pairs of residues.
Citation:
W.F. Cutlip, "R70-14 Some Results on Cascade Decomposition of Automata," IEEE Transactions on Computers, vol. 19, no. 6, pp. 565, June 1970, doi:10.1109/T-C.1970.222985
Usage of this product signifies your acceptance of the Terms of Use.