Algoritma knuth-morris pratt (KMP) pada pencocokan string

Sobariah , Khotim (2000) Algoritma knuth-morris pratt (KMP) pada pencocokan string. Undergraduate thesis, FMIPA UNDIP.

[img]PDF
Restricted to Repository staff only

1707Kb
[img]
Preview
PDF
16Kb
[img]
Preview
PDF
215Kb
[img]
Preview
PDF
335Kb
[img]
Preview
PDF
249Kb
[img]
Preview
PDF
537Kb
[img]PDF
Restricted to Repository staff only

748Kb
[img]
Preview
PDF
208Kb
[img]
Preview
PDF
211Kb
[img]
Preview
PDF
327Kb

Abstract

Algoritma Knuth-Morris-Pratt (KMP) merupakan algoritma yang dapat digunakan untuk pencocokan string antara teks dan pola, serta untuk menghitung fungsi-prefik phi. Implementasi lebih lanjut dari algoritma KMP dapat digunakan untuk pencocokan antar kalimat dengan input berupa berkas. String matching dengan finite automata dan fungsi prefik untuk sebuah pola ditunjukkan dalam penulisan tugas akhir ini. Algorithm Knuth-Morris-Pratt (KW) which used to string matching between text and pattern, also to account prefix phi-function. The detail KMP Algorithm implementation is used to match among sentences with input in file. String matching with finite automata and prefix function for a pattern was shown in this final report.

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:31793
Deposited By:Mr UPT Perpus 1
Deposited On:25 Nov 2011 08:30
Last Modified:25 Nov 2011 08:30

Repository Staff Only: item control page