Slide 4 Bina Nusantara Outline Materi: FA sebagai model komputasi Gambaran FA dgn digraph Definisi formal Analisis FA NFA Aplikasi state transduser Slide 5 Bina Nusantara Deterministic Finite Automata (DFA) q For every state q in Q and every character in, one and only one transition of the following form occurs: q sp b a q > b a r b a t ba ab Slide 6 Bina Nusantara Expressiveness of DFA DFA are a type of programs Contains concepts of imperative languages: sequences, branching and loops. Slide 2 Bina Nusantara Finite Automata II (FA) Pertemuan 24: Mata kuliah:K0144/ Matematika Diskrit Tahun:2008 Slide 3 Bina Nusantara Learning Outcomes Mahasiswa dpt membandingkan berbagai bentuk algoritma FA untuk suatu ekspresi/Syntax program agar dapat dianalisis diterima/ditolak.
0 kommentar(er)
