Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal TELKOMNIKA (Telecommunication Computing Electronics and Control)
Slamet Santosa
Staff Peneliti P3TM – BATAN
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
ALGORITMA UNTUK MATCHING PADA SISTEM PENULISAN ULANG EKSPRESI Slamet Santosa; Anton Setiawan Honggowibowo
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 3, No 2: August 2005
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v3i2.1226

Abstract

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.
Co-Authors Anton Setiawan Honggowibowo