###
DOI:
Journal of Software:1993.4(5):63-64

关于一个串为正则语言中某串的子串的判定算法
庄雷
(郑州大学计算机系,郑州 450052)
ALGORITHM FOR DECIDING WHETHER A STRING IS A SUBSTRING OF THE STRING WHICH BELONGS TO A REGULAR LANGUAGE
Zhuang Lei
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2228   Download 2600
Received:July 01, 1991    
> 中文摘要: 本文给出一个判定∑上的任意串s是否为一正则语言L中某个串的子串的算法,即设s为∑上的任一串,L是∑上的任一正则语言,则s为L中某个串的子串,当且仅当s为集合Vn={w∈∑|w∈L,|w|≤2n+k-2}中某串的子串,其中k=|s|,n是某个自然数。
中文关键词:
Abstract: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.
keywords:
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金资助项目 国家自然科学基金资助项目
Foundation items:
Reference text:

庄雷.关于一个串为正则语言中某串的子串的判定算法.软件学报,1993,4(5):63-64

Zhuang Lei.ALGORITHM FOR DECIDING WHETHER A STRING IS A SUBSTRING OF THE STRING WHICH BELONGS TO A REGULAR LANGUAGE.Journal of Software,1993,4(5):63-64