Skip Navigation

The Computer Journal 1968 11(3):277-286; doi:10.1093/comjnl/11.3.277
© 1968 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hurst, S. L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An extension of binary minimisation techniques to ternary equations

S. L. Hurst *

School of Electrical Engineering, Bath University of Technology, Ashley Down, Bristol, UK

This paper describes an extension of well-known binary minimisation techniques to cover the case where the given variables have three possible states, termed 0, 1 and 2. Both graphical and numerical minimisation techniques are considered. Algebraic relationships for 3-state (ternary) equations are also developed, which show a close relationship to the normal Boolean identities.

This work was originally presented at the British Computer Society Symposium on Logic Design, held at Reading University, July 1967.


* School of Electrical Engineering, Bath University of Technology, Ashley Down, Bristol 7


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.