Abstract
The graph-scheme of algorithm (Ianov scheme) is an efficient tool for the digital systems designer to describe the microprograms of discrete systems and to synthesize their control automata. This paper deals with the methods of transformation of graph-schemes of algorithms. The algorithm presented obtains, for any given graph-scheme, an equivalent one with a minimum number of conditional vertices.
| Original language | English |
|---|---|
| Pages (from-to) | 127-147 |
| Number of pages | 21 |
| Journal | Digital processes |
| Volume | 6 |
| Issue number | 2-3 |
| State | Published - 1980 |
| Externally published | Yes |