Professional Documents
Culture Documents
Teori Bahasa Otomata-Sesi11-12-Push-Down-Automata PDF
Teori Bahasa Otomata-Sesi11-12-Push-Down-Automata PDF
Pendahuluan
Push Down Automata
• Latar belakang munculnya konsep PDA [1 & 3]
– Terdapat context-free languages yang tidak regular,
contoh
• {0n1n | 0=<n} Is not regular
• {0n1n | 0≤n≤k, for some fixed k} Is regular, for any fixed k
– Finite Automota tidak bisa mengenal semua context-
free languages Finite Automata memiliki memory
yang terbatas
– A DFA can “remember” only a finite amount of
information, whereas a PDA can “remember” an infinite
amount of (certain types of) information
Pertemuan 11
Dosen Pembina :
Danang Junaedi
IF-UTAMA 2
IF-UTAMA 3 IF-UTAMA 4
IF-UTAMA 1
4/25/2012
IF-UTAMA 2
4/25/2012
IF-UTAMA 9 IF-UTAMA 10
IF-UTAMA 3
4/25/2012
Example 1 - 2 Example 1 - 3
• Example Computation: • Example Computation:
(1) δ(q0, a, $) = {(q1, a$)} (1) δ(q0, a, $) = {(q1, a$)}
(2) δ(q1, a, a) = {(q1, aa)} (2) δ(q1, a, a) = {(q1, aa)}
(3) δ(q1, b, a) = {(q2, ε)} (3) δ(q1, b, a) = {(q2, ε)}
(4) δ(q2, b, a) = {(q2, ε)} (4) δ(q2, b, a) = {(q2, ε)}
(5) δ(q2, ε, $) = {(q3, ε)} (5) δ(q2, ε, $) = {(q3, ε)}
Rule Applied State Input Stack Rules Applicable Rule Applied State Input Stack Rules Applicable
- q0 aabb $ (1) - q0 abb $ (1)
(1) q1 abb a$ (2) (1) q1 bb a$ (3)
(2) q1 bb aa$ (3) (3) q2 b ε$ -
(3) q2 b εa$ (4)
(4) q2 ε ε$ (5) • Karena state akhir bukan di q3 maka string abb ditolak
(5) q3 ε ε -
IF-UTAMA 15 IF-UTAMA 16
IF-UTAMA 4
4/25/2012
19 IF-UTAMA 20
IF-UTAMA 5
4/25/2012
Pertemuan 12
Dosen Pembina :
Danang Junaedi
IF-UTAMA 24
IF-UTAMA 6
4/25/2012
IF-UTAMA 25 IF-UTAMA 26
IF-UTAMA 7
4/25/2012
Referensi
1. http://www.dit.hcmut.edu.vn/~tru/AUTOMATA/chapter7.ppt, Tanggal Akses :
11 April 2009
2. http://www.cs.fit.edu/~dmitra/FormaLang/PushdownAutomata.ppt, Tanggal
Akses 11 April 2009
3. http://www.cs.nctu.edu.tw/~lwhsu/course/pl/slides/PZ03A.ppt, Tanggal Akses :
11 April 2009
4. http://semadionline.baliseven.com/materi/push_Down.ppt, Tanggal Akses : 8
April 2009
5. http://www.cs.unm.edu/~joel/cs401/Pushdown%20Automaton.ppt, Tanggal
Akses 11 April 2009
6. http://profile.iiita.ac.in/IIT2006110/Documents/fat/pushdown%20automata%20
230307%201800.ppt, Tanggal Akses : 11 April 2009
7. http://www.csc.lsu.edu/~busch/courses/theorycomp/fall2008/slides/PDA.ppt,
Tanggal Akses : 11 April 2009
8. http://www.cs.fit.edu/~dmitra/FormaLang/PushdownAutomata.ppt, Tanggal
Akses : 11 April 2009
9. Roni Djuliawan, M.T., “Diktat & Handout Kuliah Teori Bahasa &
Otomata”, Teknik Informatika – Universitas Widyatama, 2003
IF-UTAMA 29
IF-UTAMA 8