Spectral function of finite automata and related regular languages

Abstract

In the article the concept of spectral automaton function is introduced and some of its properties are considered. The language generation property of this spectral function is studied. Properties of sets with multiplicity appearing at finite automaton output are investigated. All these sets are regular, “continuable” and they form a system of classes of regular languages, which are nested in each other.