subtyping algorithm of regular tree grammars with disjoint production rules
文献类型：会议论文
| 作者 | Chen Lei ; Chen Haiming |
| 出版日期 | 2010 |
| 会议名称 | 7th International Colloquium on Theoretical Aspects of Computing, ICTAC 2010 |
| 会议日期 | September |
| 会议地点 | Natal, Brazil |
| 关键词 | Algorithms Trees (mathematics) |
| 页码 | 45-59 |
| 英文摘要 | Most type systems of statically typed XML processing languages are implemented based on regular expression types, where subtyping reduces to checking inclusion between tree automata, which is not efficient enough. The paper proposes the regular tree grammars with disjoint production rules and presents a subtyping method which is based on checking inclusion between regular expressions. The commonly used XML schema languages such as DTDs and XML Schemas can be described by the restricted grammars. The method works in a bottom-up way on the structures of type expressions. According to the regular expressions used in XML schema languages, different inclusion algorithms can be applied to this method. Experiments show the effectiveness of our method. © 2010 Springer-Verlag. |
| 会议主办者 | Univ Fed Rio Grande Norte, Univ York |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版者 | THEORETICAL ASPECTS OF COMPUTING |
| 会议录出版地 | Germany |
| ISSN号 | 3029743 |
| ISBN号 | 3642148077 |
| 源URL | [http://124.16.136.157/handle/311060/8922]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Chen Lei,Chen Haiming. subtyping algorithm of regular tree grammars with disjoint production rules[C]. 见:7th International Colloquium on Theoretical Aspects of Computing, ICTAC 2010. Natal, Brazil. September. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。