关于一个串为正则语言中某串的子串的判定算法

ALGORITHM FOR DECIDING WHETHER A STRING IS A SUBSTRING OF THE STRING WHICH BELONGS TO A REGULAR LANGUAGE

本文给出一个判定∑上的任意串s是否为一正则语言L中某个串的子串的算法,即设s为∑上的任一串,L是∑上的任一正则语言,则s为L中某个串的子串,当且仅当s为集合V_n={w∈∑|w∈L,|w|≤2n+k-2}中某串的子串,其中k=|s|,n是某个自然数。

The algorithm is given for deciding whether a string s is a substring of the string which is in a regular language L. That also means assuming s is a string over 2, L is a regular language over 2. s is a substring of the string in L, if and only if s is a substring of the string which belongs to the set Vn= {w∈∑ |w∈L, |w|≤2n+k-2} where k =| s | , n is a nature number.