Institutional Repository
| 一类受限正则表达式的推断算法 | |
| Alternative Title | Inferring Algorithm for a Subclass of Restricted Regular Expressions |
| 冯晓强; 郑黎晓; 陈海明 | |
| 2014 | |
| Source | 计算机科学
 |
| ISSN | 1002-137X |
| Volume | 41Issue:4Pages:178-183 |
| English Abstract | XML模式推断问题的主要任务可以归约为从一个句子集合中推断出对应的确定型正则表达式.提出了一类在XML模式中大量出现的受限正则表达式,给出了该类正则表达式的推断算法.该算法首先根据给定的句子集合构造自动机,然后根据自动机和句子集合推断出对应的正则表达式.该算法的时间复杂度为max(O(|V| +|E|),C(L)),其中V和E分别表示自动机的节点集合和边集合,L表示句子集合中所有句子的长度之和.对算法的终止性和正确性进行了证明. |
| Indexed Type | CSCD |
| Abstract | The problem of inferring XML schemas reduces to inferring deterministic regular expressions from a set of sentences. A subclass of restricted regular expressions which commonly occur in practical XML schemas was proposed. An algorithm for inferring this kind of regular expressions was described. The algorithm first constructs the corresponding automata according to the sentence set, then infers the regular expression from the automata and the sentence set. The complexity of the algorithm is max(O(|V|+|E|), O(L))where V and Eare the set of states and the set of edges of the constructed automata respectively, and Lis the total length of sentences. The termination and correctness of the algorithm were proved. |
| Keyword | Xml模式 模式推断 正则表达式 自动机 算法 Xml Schema Schema Inference Regular Expression Automata Algorithm |
| Department | 中国科学院软件研究所计算机科学国家重点实验室 北京100190;中国科学院大学 北京100049 华侨大学计算机科学与技术学院 厦门361021 中国科学院软件研究所计算机科学国家重点实验室 北京100190 |
| Language | 中文 |
| CSCD ID | CSCD:5113114 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16752 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 冯晓强,郑黎晓,陈海明. 一类受限正则表达式的推断算法[J]. 计算机科学,2014,41(4):178-183. |
| APA | 冯晓强,郑黎晓,&陈海明.(2014).一类受限正则表达式的推断算法.计算机科学,41(4),178-183. |
| MLA | 冯晓强,et al."一类受限正则表达式的推断算法".计算机科学 41.4(2014):178-183. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment