Digital Circuits as Moore Machines
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2010
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917205211348992 |
|---|---|
| author | Yodaiken, Victor |
| author_facet | Yodaiken, Victor |
| contents | 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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1003_0522 |
| institution | arXiv |
| publishDate | 2010 |
| record_format | arxiv |
| spellingShingle | Digital Circuits as Moore Machines Yodaiken, Victor Formal Languages and Automata Theory 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). |
| title | Digital Circuits as Moore Machines |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/1003.0522 |