Automata Theory

Asymptotic Behavior of the Number of Types of Equivalent Binary Connection Matrices

Yu. L. Sagalovich


Abstract: An asymptotic formula is derived for the number of types of binary matrices that are equivalent relative to permutations of rows and columns and/or inversion of columns. The asymptotic behavior is also obtained for the case of nonsingular matrices, for which an exact formula is as yet unknown.

UDC: 621.391.15:512.8

Received: 08.08.1977

 English version: Problems of Information Transmission, 1979, 15:2, 152–158

Bibliographic databases:

• 
•