In this paper we propose a method of finding optimal control of generalized deterministic abstract automaton, which structure is given at an arbitrary finite graph, functioning in the fuzzy given environment. The control is found for achieving fuzzy goal, which is given as a fuzzy set in any fixed finite vertex of the structural graph of the automaton. A solution of the problem consists of two stages, the first of which gives maximally possible degree of the achieving fuzzy goal depending from the way from initial vertex of a graph to fixed, and the second stage allows to construct a set of input words, providing an achieving this goal on chosen way. In conclusion, an example of application of proposed method of construction regular expressions controlling sequences to a given abstract finite-nonstationary deterministic automaton is given. Refs 5. Figs 2.