Structure theory for the realization of finite state automata Final report, 1 Nov. 1966 - 31 Oct. 1968

Feedback and inessential errors in sequential machines, realization of sequential machines, and logic hazards in threshold gate network

An effective cube comparison method for discrete spectral transformations of logic functions

Spectral methods have been used for many applications in digital logic design, digital signal processing and telecommunications. In digital logic design they are implemented for testing of logical networks, multiplexer-based logic synthesis, signal processing, image processing and pattern analysis. New developments of more efficient algorithms for spectral transformations (Rademacher-Walsh, Generalized Reed-Muller, Adding, Arithmetic, multiple-valued Walsh and multiple-valued Generalized Reed- Muller) their implementation and applications will be described

A QOBDD-based Approach to Simple Games

Simple games are a commonly used model for the analysis of voting systems in which each participant can vote “yes” or “no” and where the outcome is “yes” or “no” as well. Quasi-reduced and ordered binary decision diagrams, or QOBDDs for short, are well-known as compact representations for subsets of powersets and Boolean functions. In this thesis, we use QOBDDs to represent simple games and to develop practically applicable algorithms to solve problems for simple games. We study properties of QOBDDs when they are used to represent simple games as well as the runtime behavior of our algorithms

An Algorithm for Testing 2-Asummability of Boolean Functions

Simple algorithms have been developed to generate pairs of minterms forming a given 2-sum and thereby to test 2-asummability of switching functions. The 2-asummability testing procedure can be easily implemented on the computer. Since 2-asummability is a necessary and sufficient condition for a switching function of upto eight variables to be linearly separable (LS), it can be used for testing LS switching functions of upto eight variables