Sobariah , Khotim (2000) Algoritma knuth-morris pratt (KMP) pada pencocokan string. Undergraduate thesis, FMIPA UNDIP.
![[img]](/style/images/fileicons/application_pdf.png) | PDF Restricted to Repository staff only 1740Kb | |
| PDF 15Kb | |
| PDF 217Kb | |
| PDF 357Kb | |
| PDF 251Kb | |
| PDF 544Kb | |
| PDF Restricted to Repository staff only 759Kb | |
| PDF 19Kb | |
| PDF 21Kb | |
| PDF 139Kb |
Abstract
Algoritma Knuth-Morris-Pratt (KMP) merupakan algoritma yang dapat digunakan untuk pencocokan string antara teks dan pola, serta untuk rnenghitung 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 (KMP) 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: | 31798 |
| Deposited By: | Mr UPT Perpus 1 |
| Deposited On: | 25 Nov 2011 08:41 |
| Last Modified: | 25 Nov 2011 08:41 |
Repository Staff Only: item control page
