Digital Circuits as Moore Machines

TL;DR

This paper presents a method to specify digital circuits using Moore machines, enabling clear modeling of timing and logic for various components through automata theory.

Contribution

It introduces a technique to specify digital circuits as Moore machines, combining automata theory with recursive functions for circuit design.

Findings

Specification of gates, latches, and circuits as Moore machines

Construction of devices starting from SR latch

Application of automata theory to digital circuit design

Abstract

This paper illustrates a technique for specifying the timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines with output (Moore machines). The method is illustrated here with specifications of gates, latches, and other simple circuits and via the construction of devices starting with a SR latch built from gates. The method is based on "classical" automata and recursive functions on strings (sequential functions).