期刊名称：TELKOMNIKA (Telecommunication Computing Electronics and Control)
印刷版ISSN：2302-9293
出版年度：2005
卷号：3
期号：2
页码：117-121
DOI：10.12928/telkomnika.v3i2.1226
语种：English
出版社：Universitas Ahmad Dahlan
摘要：Matching process in tree is finding subtree in a given tree which to be replaced to variables those occur in pattern tree. It is an important problem that occurs as a crucial operation in functional and equational programming such as Term Rewriting System. We present an algorithm for matching process on such term in tree based on pattern matching. We linearize both given tree and pattern tree into string representation by using Euler technique and and apply prefix-sum to computers the rank of all linearized edge. And then we do matcing on string sequential.
