1 / 16

TEORI BAHASA & OTOMATA (ALGORITMA & MESIN KOMPUTASI)

TEORI BAHASA & OTOMATA (ALGORITMA & MESIN KOMPUTASI). PERTEMUAN IV Y A N I S U G I Y A N I. MATERI PERTEMUAN IV. MESIN POST MESIN STATA HINGGA LATIHAN. MESIN POST. Mesin post digunakan untuk mengenali bahasa L = { a n b n | n >= 0}

zytka
Download Presentation

TEORI BAHASA & OTOMATA (ALGORITMA & MESIN KOMPUTASI)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. TEORI BAHASA & OTOMATA(ALGORITMA & MESIN KOMPUTASI) PERTEMUAN IV Y A N I S U G I Y A N I

  2. MATERI PERTEMUAN IV • MESIN POST • MESIN STATA HINGGA • LATIHAN

  3. MESIN POST • Mesin post digunakanuntukmengenalibahasa L = {anbn | n >= 0} • Jelasanggota L adalahuntaihampa, ab, aabb, aaabbb….. Dan seterusnya

  4. MESIN POST • 3 fungsiterhadap T’ adalah : - head(x) adalahhuruf paling kiri/leftmost dari x - Tail(x) adalahekordari x, diperoleh denganmenghapus head(x) - a.xadalahmenyambunghuruf a di depanuntai x

  5. MESIN POST

  6. MESIN POST • Statement yang digunakan : 1. Statement START 2. Statement HALT

  7. MESIN POST 3. Statement TEST

  8. MESIN POST

  9. MESIN POST 4. Statement ASSIGNMENT

  10. MESIN POST

  11. MESIN STATA HINGGA • StrukturMesinStataHinggaterdiridari : 1. Himpunanhingga A berisisimbol input 2. Himpunanhingga S berisistata (internal state) 3. Himpunanhingga Z berisisimboloutput 4. Sebuahfungsi f : S x A  S, disebutfungsi next state 5. Sebuahfungsi g : S x A  Z, disebutfungsi output

  12. MESIN STATA HINGGA • Contoh : (1) A = (a,b) (2) S = (q0, q1,q2) (3) Z = (x,y,z)

  13. MESIN STATA HINGGA (4) fungsi next state f : S x A  S f(q0,a) = q1 f(q0,b) = q2 f(q1,a) = q2 f(q1,b) = q1 f(q2,a) = q0 f(q2,b) = q1 (5) Fungsi output g : S x A  Z g(q0,a) = x g(q0,b) = y g(q1,a) = y g(q1,b) = z g(q2,a) = z g(q2,b) = y

  14. MESIN STATA HINGGA • BUATLAH : - TabelMesinStatahingga - MesinStatahingga - periksalahuntaiaaba

  15. LATIHAN

  16. LATIHAN

More Related