KLEENE’S THEOREM ANALOG FOR THE GENERALIZED NON-DETERMINISTIC FINITE AUTOMATA

  • Svetlana Victorovna Baumgertner

Abstract

In this paper, we consider the formalism, that is describe special extention for the non-deterministic finite automaton. These automata make it possible to describe addition operation used for generalized regular expressions.
Section
Technical Sciences