1 / 15

Deterministic Finite Automata

Deterministic = sudah ditetapkan. Deterministic Finite Automata. unik 1 masukan + 1 state  1 state. Yenni Astuti Version 1.0.1. Finite Automata. FA = Komputer dengan memori terbatas . Contoh Penerapan: Pengendali pintu otomatis (bit memori: tunggal)

rumer
Download Presentation

Deterministic Finite Automata

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. Deterministic = sudah ditetapkan Deterministic Finite Automata unik 1 masukan + 1 state  1 state Yenni Astuti Version 1.0.1

  2. Finite Automata • FA = Komputer dengan memori terbatas. • Contoh Penerapan: • Pengendali pintu otomatis (bit memori: tunggal) • Pengendali lift (bit memori: beberapa) • Pencuci piring • Termostat elektronis • Jam Digital • Kalkulator

  3. Pengendali pintu otomatis

  4. Pengendali elevator

  5. Dishwasher

  6. Termostat Elektronis

  7. Jam Digital

  8. Kalkulator

  9. Perspektif Matematis • FA juga berguna untuk mengenali pola suatu data, misalnya dalam pemrosesan suara, dan pengenalan optis. • FA dari sisi matematika merupakan cara untuk mendefinisikan otomata dan memanipulasi otomata untuk mendapatkan teorinya serta kelemahan dan kelebihan FA. • Setelah mengetahui teori, kelemahan, kelebihan, penggunaan praktisnya menjadi lebih mudah.

  10. Pemrosesan Suara

  11. Pengenalan Karakter Optis

  12. Mendesain FA • Design is a creative process. • It can not be reduced to a simple recipe or formula. Namun suatu pendekatan dapat dilakukan untuk pertolongan. • Jadilah mesin otomata yang hendak kalian buat.

  13. Representasi DFA (kelas A) • Diagram transisi keadaan. • 5-tuple 1,0 0 1 q q1 0 q10 0 1 1 q100 • M = ({q,q1,q10,q100}, {0,1}, , q, {q100}) •  =

  14. Representasi DFA (kelas B) • Diagram transisi keadaan. • 5-tuple 0 1,0 1 q q0 0 q01 1 0 1 q001 • M = ({q,q0,q01,q001}, {0,1}, , q, {q001}) •  =

  15. Practise Makes Perfect

More Related