Abstract
Methods of control automata synthesis, the behavior of which is described by graph-schemes of algorithms, are considered. The algorithms presented allow the synthesis of automata containing tens and hundreds of input and output terminals even with no computer usage. The decomposition methods are used in logical circuit design.
| Original language | English |
|---|---|
| Pages (from-to) | 149-165 |
| Number of pages | 17 |
| Journal | Digital processes |
| Volume | 6 |
| Issue number | 2-3 |
| State | Published - 1980 |
| Externally published | Yes |