DAFTAR PUSTAKA. (Diakses pada

Ukuran: px

Mulai penontonan dengan halaman:

Download "DAFTAR PUSTAKA. (Diakses pada"

Sudirman Iskandar
6 tahun lalu
Tontonan:

1 90 DAFTAR PUSTAKA 1. Abay. (2011). Eclipse. (Diakses pada 19 February 2. Anderson. P. (2008). Implementation of Algorithms for State Minimisation and Conversion of Regular Expressions to and from Finite Automata. Birkbeck College, University of London. (Diakses pada 9 February 3. Astuti, Yenni. (2011). Deterministic Finite Automata. yennistuff.files.wordpress.com/2011/10/03-dfa.pptx (Diakses pada 24 April 4. Bhargava, Sanjay and Purohit, G.N. (2011). Construction of a Minimal Deterministic Finite Automaton from a Regular Expression. Volume 15 No.4, February (Diakses pada 6 February 5. Ding-Zhu, Du., dan Ko, K-I. (2001). Problem Solving in Automata, Languages, and Complexity. John Wiley and Son, Inc. ISBN Farooq, Amjad and Arshad, M. Junaid and Fahiem, Muhammad Abuzar. (2010). A Z-Notation Formalization of Deterministic Finite Automata. VOL. 1, NO. 2, NOVEMBER (Diakses pada 6 February

2 91 7. Fatimah, Wina Noviani. (2011). Pengenalan Eclipse. (Diakses pada 7 September 8. Fauzan. (. Finite Automata. (Diakses pada 7 September 9. Hasanah, Dewi Kurniawati. (2003). Deterministic Finite Automata. ITB, Bandung. (Diakses pada 20 February 10. Holub, Jan and Stekr, Stanislav. (2008). Implementation of Deterministic Finite Automata on Parallel Computers. Czech Technical University, Prague. (Diakses pada 18 February 11. Hopcroft, J E., Motwani, R., dan Ullman, J D. (2007). Introduction to Automata Theory, Languages and Computation. Pearson Addison-Wesley, Upper Saddle River, NJ, 3. edition, ISBN Hopcroft, J E., Motwani, R., dan Ullman, J D. Introduction to Automata Theory, Languages, and Computation. (Diakses pada 18 February 13. IST-ASAG. Eclipse IDE Installation Instruction. (Diakses pada 20 February

3 Kakde, O.G. (2002). Algorithms for Compiler Design. Charles River Media, Inc. ISBN Karmilasari. PENGEMBANGAN PERANGKAT LUNAK. karmila.staff.gunadarma.ac.id/downloads/files/15710/rpl.pdf (Diakses pada 19 February 16. Mogensen, T A. (2010). Basics of Compiler Design, Anniversary edition. Department of Computer Science University of Copenhagen. ISBN Nofiari, Elfan. Nondeterministic Finite Automata (NFA). (Diakses pada 20 February 18. Nurkifli, E. Haodudin. (2010). USE CASE DIAGRAM. (Diakses pada 7 September 19. Pandey, Aakanksha and Khare, Nilay. (. Efficient String Matching Using Deterministic Finite Automation Hardware: Speed vs Area Tradeoff. Volume 44 No18, April (Diakses pada 14 Mei 20. Pressman, Roger S. (2005). Software Engineering: A Practitioner s Approach 6th ed. Boston : McGraw-Hill. 21. Proboyekti, Umi. SOFTWARE PROCESS MODEL I. (Diakses pada 22 February

4 Raitt, L A. (2006). Random generation of finite automata over the domain of the regular languages. University of Stellenbosch. (Diakses pada 14 Mei 23. Ramaswamy, V and Girijamma H. A. (. Conversion of Finite Automata to Fuzzy Automata for String Comparison. Volume 37 No.8, January (Diakses pada 14 Mei 24. Saxena, Vipin and Kumar, Santosh. (. Validation of UML Class Model through Finite-State Machine. Volume 41 No.19, March (Diakses pada 14 Mei 25. Sudarsono. Flowchart. sdarsono.staff.gunadarma.ac.id/downloads/files/16512/flowchart.pdf (Diakses pada 7 September 26. Suwarningsih, Wiwin. (2007). INTELLIGENT DECISION SUPPORT SYSTEM DALAM MENDETEKSI BEHAVIOUR SIRKUIT LOGIKA. Pusat Penelitian Informatika LIPI, Bandung. (Diakses pada 24 April 27. Wang, Minjun and Fox, Geofrrey and Pierce, Marlon. (2006). Collaboration Entities on Deterministic Finite Automata. Indiana University, U.S.A (Diakses pada 6 February

5 Wardhana, Ignatius Giri. (2011). FINITE STATE AUTOMATA SIMULATOR (FAST): TOOL UNTUK SIMULASI DAN TRANSFORMASI FINITE STATE AUTOMATA. Universitas Gajah Mada, Yogyakarta. (Diakses pada 5 February 29. Wibowo, Agung Toto. (2010). CS3113 Teori Komputasi STT Telkom Deterministik-Finite-Automata.pdf (Diakses pada 20 February 30. Wibowo, Agung Toto. (2010). CS3113 Teori Komputasi STT Telkom 2009/ (Diakses pada 24 April 31. X.U.Yingjie (2009). Describing an n log n algorithm for minimizing states in deterministic finite automaton. Stellenbosch University, SOUTH AFRICA (Diakses pada 18 February

dokumen-dokumen yang mirip

PEMODELAN PERANGKAT LUNAK UNTUK PENGERTIAN DETERMINISTIC FINITE AUTOMATA DAN NON-DETERMINISTIC FINITE AUTOMATA

PEMODELAN PERANGKAT LUNAK UNTUK PENGERTIAN DETERMINISTIC FINITE AUTOMATA DAN NON-DETERMINISTIC FINITE AUTOMATA Santa Meilisa; Ngarap Im Manik; Djunaidy Santoso Universitas Bina Nusantara, Jl. Mawar Bukit