2- https://doi.org/10.1109/te.1977.4321109
ABAL-a language for boolean function representation and manipulation
- Feb 1, 1977
- IEEE Transactions on Education
- Iong Chen +1 more
Abstract
A language ABAL (Auburn Boolean Algebra Language) is described in this paper that permits machine representation and manipulation of Boolean functions. Functions may be specified in algebraic form or as lists of minterms or maxterms. Types of operations available in the language include functional form changes, simplification rules, prime implicant or prime implicate generation, functional minimization, functional combinations using Boolean operators, and truth table generation. ABAL is written in Basic-Plus for execution on a DEC PDP 11/40 RSTS/E System.
- # Boolean Function Manipulation
- # DEC PDP
- # Simplification Rules
- # Prime Implicant
- # Boolean Operators
- # Boolean Function Representation
- # Algebraic Form
- # Boolean Function
- # Functional Minimization
- # Functional Simplification
Similar Papers
