|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| D.M. Chang, T.H., Jr. Mott, "Author's Reply," IEEE Transactions on Computers, vol. 28, no. 11, pp. 875, November, 1979. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1979.1675271, author = {D.M. Chang and T.H., Jr. Mott}, title = {Author's Reply}, journal ={IEEE Transactions on Computers}, volume = {28}, number = {11}, issn = {0018-9340}, year = {1979}, pages = {875}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675271}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Author's Reply IS - 11 SN - 0018-9340 SP EP EPD - 875 A1 - D.M. Chang, A1 - T.H., Jr. Mott, PY - 1979 KW - null VL - 28 JA - IEEE Transactions on Computers ER - | |||
The theorem in question, Theorem 4, appears as an auxiliary part of a paper by Chang and Mott,1 whose main result was the presentation and justification of a new method for computing irredundant normal forms based on the concepts of abbreviated presence function, ratio function, and iterated consensus of prime implicants. The validity of the authors' method is unchallenged by the counterexample of Cutler and Muroga. Rather, their counterexample is intended only to question auxiliary Theorem 4, which attempts to specify new conditions for the absolute dispensability of prime implicants.
Citation:
D.M. Chang, T.H., Jr. Mott, "Author's Reply," IEEE Transactions on Computers, vol. 28, no. 11, pp. 875, Nov. 1979, doi:10.1109/TC.1979.1675271
Usage of this product signifies your acceptance of the Terms of Use.