Realization of Boolean Expressions by Atomic Digraphs

Authors:
R. E. Prather;H. T. Casstevens
Affiliations:
Department of Mathematics, University of Denver;-
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 4
Cited 0

An Algorithm for Translating Boolean Expressions

Journal of the ACM (JACM)
Discrete Mathematical Structures for Computer Science

Discrete Mathematical Structures for Computer Science
Would you believe structured Fortran?

ACM SIGNUM Newsletter
Structured programming

Structured programming

Quantified Score

Hi-index	14.98

Visualization

Abstract

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."