Part 3. Mathematical models

Estimation of the number of labelings of group automata graphs

R. A. Ishchenko

Lomonosov Moscow State University

Abstract: If we remove symbols of a state diagram, then we get a directed graph. The inverse operation, when this information is restored, is called graph labeling. This article estimates the number of graph labelings that lead to a group automata.

Keywords: group automata, transition graph, state diagram, permanent, matrix decomposition.