Digital Circuits as Moore Machines
Formal Languages and Automata Theory
2026-01-16 v2
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).
Keywords
Cite
@article{arxiv.1003.0522,
title = {Digital Circuits as Moore Machines},
author = {Victor Yodaiken},
journal= {arXiv preprint arXiv:1003.0522},
year = {2026}
}