The Algorithm of Matrix Mapping of a Graph on a Boolean Cube | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2011. № 3(16).

HomeIssuesThe Algorithm of Matrix Mapping of a Graph on a Boolean Cube | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2011. № 3(16).

The Algorithm of Matrix Mapping of a Graph on a Boolean Cube

The problem, considered in the paper, has important applications for the discrete device designing.To this problem can be reduced the problem of minimization of the memory triggeringnumber in a circuit implementation of some finite state machine. The paper proposes formal matrixmethod to solve this problem, based on visual method, suggested earlier, and is oriented to thecomputer implementation.

Download file
Counter downloads: 343

Keywords

граф переходов, матрица смежности, булев куб, матрица куба, кодирование состояний, отображение ребер, Boolean cube, matrix cube, coding of states, adjacency matrix, edge mapping

Authors

NameOrganizationE-mail
Zakrevskiy Arkadiy D.United Institute of Informatics Problems, NAS of Belarus (Minsk)zakr@newman.bas-net.by
Всего: 1

References

The Algorithm of Matrix Mapping of a Graph on a Boolean Cube | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2011. № 3(16).

The Algorithm of Matrix Mapping of a Graph on a Boolean Cube | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2011. № 3(16).

Download file