Cart (Loading....) | Create Account
Close category search window
 

Realization of Boolean Expressions by Atomic Digraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Prather, R.E. ; Department of Mathematics, University of Denver ; Casstevens, H.T.

A theory relating certain labeled directed graphs and Boolean expressions over propositional variables is seen to have several interesting applcations in computer science, most notably to programming, compiling, and switching theory. The applications arise from the capability of realizing any Boolean expression by a member of the class of digraphs here considered, those we shall call "atomic."

Published in:

Computers, IEEE Transactions on  (Volume:C-27 ,  Issue: 8 )

Date of Publication:

Aug. 1978

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.