2004•Unpublished venueRequires access

Optimal design by resolving Boolean equations

Bernd Steinbach, Ch. Posthoff

Abstract

The optimal design of a non-deterministic finite state machine by solving and resolving Boolean equations is shown, taking advantage of the relationships between single Boolean functions, sets of Boolean functions, Boolean equations, and their solutions. The Boolean differential calculus is used to point out the key ideas of the applied resolvability theory.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Boolean function, Product term, Boolean expression, Boolean circuit, Circuit minimization for Boolean functions, Standard Boolean model, Boolean network, Parity function