Graphs of logical automata and their transformations

The paper is concerned with a new language for description of logical automata, or automata with binary inputs and outputs, the language of switching graphs. In such a graph in each edge only those output that change their value at a specific transition are indicated. Equivalent transformations of such automata are studied; the number of vertices in the graph can be smaller than that of states in the associated automaton.