We consider a discrete system governing the operation of a dynamic automaton with memory. We establish sufficient optimality conditions for such a system and obtain equations for synthesis of optimal position control. Applications of the optimality conditions are illustrated by examples. Bibliography: 34 titles. Illustrations: 4 figures.Discrete automaton type systems are described by recurrent equations or inclusions and serve as mathematical models of control devices in the form of an automaton with memory. The discrete automaton type systems constitute a part of dynamical systems with an automaton part [1, 2], logic-dynamic systems [3]-[7], and hybrid systems [8]- [13]. Unlike the classical models of discrete systems [14,15], where the states are changed (switched) at prescribed (switching) times, the states of discrete automaton type systems can be switched at artibtary times [16,17].As in logic-dynamic systems, optimal processes with instantaneous multiple switchings can arise in automaton type systems [2]. Such processes are limits of minimizing sequrences in which the switching times tend to a limit without violating their mutual arrangement. It turns out that the automaton type system performs instantaneous multiple switchings at this limiting point. Examples show that such processes appear in usual problems, in particular, in the control problem for linear automaton type systems with a quadratic cost function [18,19]. We note that processes with instantaneous multiple switchings do not occur in continuous [20], discrete [14,15], discrete-continuous [21], impulse [22]-[24], and switched [4], [25]-[29] systems.In this paper, we consider problems in which the automaton type system performs instantaneous multiple switchings at each switching time moment and the total number of switchings is finite. The switching times and the number of instantaneous switchings at each switching