Publication: Some Properties of the Extended Basis Finite Automata
Дата
2021
Авторы
Melnikov, B.
Melnikova, A.
Journal Title
Journal ISSN
Volume Title
Издатель
Аннотация
© 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.We continue to consider a special extension of the class of nondeterministic finite automata. With these automata we can simplify some proofs, which are necessary for ordinary finite automata. In the paper, we consider the definition of extended finite automata, define the extended basic finite automaton for the given regular language and consider some simple properties of this automaton. For instance, the extended basic automaton constructed on the basis of the source regular language really defines this language. All this allows to simplify the definition of an extended basic automaton. The main content of this paper is the following. In one of our previous papers, there was formulated a statement about properties of the state-marking functions of the extended basis automaton. Namely, we consider the possibility of combining states. This possibility is not at all obvious, since such a combining, generally speaking, leads to the formation of new loops, which entails a complete change in the definition of the transition functions of automata, in which the corresponding set of loops is very important. Before, there was given a scheme of the proof; in this paper, we give a complete proof. #CSOC1120
Описание
Ключевые слова
Цитирование
Melnikov, B. Some Properties of the Extended Basis Finite Automata / Melnikov, B., Melnikova, A. // Lecture Notes in Networks and Systems. - 2021. - 228. - P. 586-591. - 10.1007/978-3-030-77448-6_57