90
DAFTAR PUSTAKA 1. Abay. (2011). Eclipse. http://bayduaenam.blogspot.com/2011/06/eclipse.html (Diakses pada 19 February 2012) 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. http://regex-automaton.com/ (Diakses pada 9 February 2012) 3. Astuti, Yenni. (2011). Deterministic Finite Automata. yennistuff.files.wordpress.com/2011/10/03-dfa.pptx (Diakses pada 24 April 2012) 4. Bhargava, Sanjay and Purohit, G.N. (2011). Construction of a Minimal Deterministic Finite Automaton from a Regular Expression. Volume 15– No.4, February 2011 http://www.ijcaonline.org/volume15/number4/pxc3872589.pdf (Diakses pada 6 February 2012) 5. Ding-Zhu, Du., dan Ko, K-I. (2001). Problem Solving in Automata, Languages, and Complexity. John Wiley and Son, Inc. ISBN 0-471-22464-2. 6. Farooq, Amjad and Arshad, M. Junaid and Fahiem, Muhammad Abuzar. (2010). A Z-Notation Formalization of Deterministic Finite Automata. VOL. 1, NO. 2, NOVEMBER 2010 http://www.ijmse.org/Volume1/Issue2/paper5.pdf (Diakses pada 6 February 2012)
91
7. Fatimah, Wina Noviani. (2011). Pengenalan Eclipse. http://wi01.files.wordpress.com/2011/02/pengenalan-eclipse.pdf (Diakses pada 7 September 2012) 8. Fauzan. (2012). Finite Automata. http://fauzanberbagi.blogspot.com/2012/04/finite-automata.html (Diakses pada 7 September 2012) 9. Hasanah, Dewi Kurniawati. (2003). Deterministic Finite Automata. ITB, Bandung. http://kur2003.if.itb.ac.id/file/DFA.pdf (Diakses pada 20 February 2012) 10. Holub, Jan and Stekr, Stanislav. (2008). Implementation of Deterministic Finite Automata on Parallel Computers∗. Czech Technical University, Prague. http://www.cs.up.ac.za/cs/sgruner/Festschrift/paper06.pdf
(Diakses pada
18 February 2012) 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, 2007. ISBN 978-0-321-51448-6. 12. Hopcroft, J E., Motwani, R., dan Ullman, J D. Introduction to Automata Theory, Languages, and Computation. http://unipa.cblue.org/UnipaCblue/Corsi0910_files/Grammatiche-Cap5.pdf (Diakses pada 18 February 2012) 13. IST-ASAG. Eclipse IDE Installation Instruction. http://ist.berkeley.edu/asag/tools/howto/install-eclipse-win.html (Diakses pada 20 February 2012)
92
14. Kakde, O.G. (2002). Algorithms for Compiler Design. Charles River Media, Inc. ISBN 1-58450-100-6. 15. Karmilasari. PENGEMBANGAN PERANGKAT LUNAK. karmila.staff.gunadarma.ac.id/Downloads/files/15710/RPL.pdf (Diakses pada 19 February 2012) 16. Mogensen, T A. (2010). Basics of Compiler Design, Anniversary edition. Department of Computer Science University of Copenhagen. ISBN 978-87993154-0-6. 17. Nofiari, Elfan. Nondeterministic Finite Automata (NFA). http://kur2003.if.itb.ac.id/file/NFA.pdf (Diakses pada 20 February 2012) 18. Nurkifli, E. Haodudin. (2010). USE CASE DIAGRAM. http://informatikauad.files.wordpress.com/2010/12/pertamuan-4-apbo-use-casediagram.ppt (Diakses pada 7 September 2012) 19. Pandey, Aakanksha and Khare, Nilay. (2012). Efficient String Matching Using Deterministic Finite Automation Hardware: Speed vs Area Tradeoff. Volume 44– No18, April 2012. http://research.ijcaonline.org/volume44/number18/pxc3878750.pdf (Diakses pada 14 Mei 2012) 20. Pressman, Roger S. (2005). Software Engineering: A Practitioner’s Approach 6th ed. Boston : McGraw-Hill. 21. Proboyekti, Umi. SOFTWARE PROCESS MODEL I. http://lecturer.ukdw.ac.id/othie/softwareprocess.pdf (Diakses pada 22 February 2012)
93
22. Raitt, L A. (2006). Random generation of finite automata over the domain of the regular languages. University of Stellenbosch. https://scholar.sun.ac.za/handle/10019.1/19646 (Diakses pada 14 Mei 2012) 23. Ramaswamy, V and Girijamma H. A. (2012). Conversion of Finite Automata to Fuzzy Automata for String Comparison. Volume 37– No.8, January 2012. http://research.ijcaonline.org/volume37/number8/pxc3876647.pdf (Diakses pada 14 Mei 2012) 24. Saxena, Vipin and Kumar, Santosh. (2012). Validation of UML Class Model through Finite-State Machine. Volume 41– No.19, March 2012. http://research.ijcaonline.org/volume41/number19/pxc3877831.pdf (Diakses pada 14 Mei 2012) 25. Sudarsono. Flowchart. sdarsono.staff.gunadarma.ac.id/Downloads/files/16512/Flowchart.pdf (Diakses pada 7 September 2012) 26. Suwarningsih, Wiwin. (2007). INTELLIGENT DECISION SUPPORT SYSTEM DALAM MENDETEKSI BEHAVIOUR SIRKUIT LOGIKA. Pusat Penelitian Informatika LIPI, Bandung. http://journal.uii.ac.id/index.php/Snati/article/viewFile/1700/1482 (Diakses pada 24 April 2012) 27. Wang, Minjun and Fox, Geofrrey and Pierce, Marlon. (2006). Collaboration Entities on Deterministic Finite Automata. Indiana University, U.S.A http://grids.ucs.indiana.edu/ptliupages/publications/CollabEntitiesDFA.pdf (Diakses pada 6 February 2012)
94
28. Wardhana, Ignatius Giri. (2011). FINITE STATE AUTOMATA SIMULATOR (FAST): TOOL UNTUK SIMULASI DAN TRANSFORMASI FINITE STATE AUTOMATA. Universitas Gajah Mada, Yogyakarta. http://pulungan.staff.ugm.ac.id/students/wardhana-thesis.pdf (Diakses pada 5 February 2012) 29. Wibowo, Agung Toto. (2010). CS3113 Teori Komputasi STT Telkom 2007. http://tekom.blog.ittelkom.ac.id/blog/files/2010/02/cs3113-05-NonDeterministik-Finite-Automata.pdf (Diakses pada 20 February 2012) 30. Wibowo, Agung Toto. (2010). CS3113 Teori Komputasi STT Telkom 2009/2010. http://tekom.blog.ittelkom.ac.id/blog/files/2010/02/cs3113-03-Diagram-Transisidan-Tabel-Transisi.pdf (Diakses pada 24 April 2012) 31. X.U.Yingjie (2009). Describing an n log n algorithm for minimizing states in deterministic finite automaton. Stellenbosch University, SOUTH AFRICA http://www.cs.sun.ac.za/rw711/documentation/hopcroft2.pdf (Diakses pada 18 February 2012)
