Closing of Regular Languages under Non-regular Operations
Guo Shu · Journal of Jiamusi University · 2005
This paper strictly proof the existence of a deterministic finite automata which can recognize three kinds of non-regular operations of regular languages, in the construction method. Thus, it sets up the results of the class of regular languages is closed under the non-regular operations∩,-and, we have presented three deterministic finite automata models that recognized three language operations.