Resumen
In the second part of this paper, we continue to consider a special extension of the class of nondeterministic finite automata. We show by examples the following fact: there are regular languages, in the basis automata of which, some vertices do not have loops corresponding to the loops of the corresponding vertices of other equivalent automata; however, precisely such loops do exist at similar vertices of extended basic automata. We also continue to consider the extended basic finite automaton. We prove that for such an automaton, all auxiliary languages obtained in the constructions are regular; this fact is the main subject of Part II. All of the above allows us to simplify the definition of the extended basic automaton. In addition, we show the possibility of using extended finite automata for proving statements related to "ordinary" nondeterministic finite automata, as well as the inverse possibility of using "ordinary" automata to prove statements related to extended basic automata. At the end of the paper, we describe the possibilities of applying this formalism, in particular, the use of extended automata in algorithms for minimizing non-deterministic finite automata.