DAFTAR PUSTAKA [1] John E. Colby, “Tree Automata, Grammars And Parsing Schemata: Equivalent Systems For Constraint Solving”, University Of California Santa Cruz, 2007 [2] Dassow J., Mitrana V., 2000, Finite Automata Over Free Groups, International Journal Of Algebra And Computation Vol. 10, No. 6 (2000) 725-737). [3] Chenguang Luo, “From Word Automata to Tree Automata”, The 9th International Conference for Young Computer Scientists, IEEE DOI 10.1109/ICYCS.2008.176, 2008 [4] Alessandro Facchini, Filip Murlak, Michał Skrzypczak, “Rabin-Mostowski Index Problem: A Step Beyond Deterministic Automata”, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE DOI 10.1109/LICS.2013.56, 2013 [5] Han Hui, “Algorithm of Learning Weighted Automata”, International Conference on Computational and Information Sciences, 2013 [6] Corson J.M., 2005, Extended Finite Automata And Word Problems, International Journal Of Algebra And Computation, Vol. 15, No. 3 (2005) 455–466, World Scientific Publishing Company). [7] Rajesh Prasad, Suneeta Agarwal, “A New Parameterized String Matching Algorithm by Combining Bit-Parallelism and Suffix Automata”, IEEE, 978-1-4244-2358-3, CIT, 2008 [8] Boris Melnikov, Andrey Tsyganov, “The State Minimization Problem For Nondeterministic Finite Automata: the parallel implementation of the truncated
branch
and
bound
method”,
IEEE,
DOI
10.1109/PAAP.2012.36, Fifth International Symposium on Parallel Architectures, Algorithms and Programming, 2012 [9] Birkendorf A., Boker A, And Simon H.U., 2000, Learning Deterministic Finite Automata From Smallest Counterexamples ∗, Siam J. Discrete Math., Vol. 13, No. 4, Pp. 465–491, 2000.
[10] Xiangru Xu, Yanqiong Zhang, Yiguang Hong, Matrix Approach to Stabilizability of Deterministic Finite Automata, American Control Conference (ACC) Washington, DC, USA, June 17-19, 2013 [11] Kaitai Liang, Man Ho Au, Member, IEEE, Joseph K. Liu, Willy Susilo, Senior Member, IEEE, Duncan S. Wong, Member, IEEE, Guomin Yang, Member, IEEE, Tran Viet Xuan Phuong, and Qi Xie, “A DFA-Based Functional Proxy Re-Encryption Scheme for Secure Public Cloud Data Sharing”, IEEE transactions on information forensics and security, vol. 9, No. 10, october 2014 [12] Yuchong Li, Xingguo Luo, Xiangyu Shao, Dong Wei, “MDC-DFA:A Multidimensional
Cube
Deterministic
Finite Automata-Based
Feature
Matching Algorithm “IEEE, 978-1-4673-7116-2/15, 2015 [13] Abuzer Yakaryılmaz, J. Andres Montoya, “On discerning strings with finite automata“, XLI Latin American Computing Conference (CLEI), 2015 [14] Ayesha Khalid_, Rajat Sen, Anupam Chattopadhyay, “SI-DFA: Subexpression Integrated Deterministic Finite Automata for Deep Packet Inspection”, IEEE 14th International Conference on High Performance Switching and Routing, 2013 [15] Marco Leogrande, ”Modeling Complex Packet Filters With Finite State Automata”, IEEE/Acm Transactions On Networking, Vol. 23, No. 1, February 2015 [16] Sun Rui, Zhong Deming “Translating Software Requirement from Natural Language to Automaton”, International Conference on Mechatronic Sciences, Electric Engineering and Computer (MEC) Dec 20-22, Shenyang, China, 2013 [17]. Yohanes Bowo Widodo, “Simulator Finite Automata Sebagai alat perancang Regular Language”, Jurnal llmiah llmu Komputer, Vol. 1 No. 2 Mei 2003: 69-76.
[18] Pinaki Chakraborty, P.C. Saxena , C.P. Katti, “Fifty Years of Automata Simulation: A Review”, acm Inroads Vol. 2 No. 4 December 2011, 59 – 70. [19] Sinar Sinurat, “ Simulasi Transformasi Regular Expression Terhadap Finite State Automata”, Pelita Informatika Budi Darma, Volume : IV, Nomor: 1, Agustus 2013, ISSN : 2301-9425 [20] Marcin Luckner, “Conversion of Decision Tree Into Deterministic Finite Automaton for High Accuracy Online SYN Flood Detection”, IEEE Symposium Series on Computational Intelligence, 2015 [21] Daniel Cazalis, “Algebraic Theory Of Minimal Nondeterministic Finite Automata With Applications”, Florida International University, Miami, Florida, 2007 [22] P.Insap Santoso “Struktur Data dengan Turbo Pascal”, Andi Offset Yogyakarta, 1992 [23] Gilles Brassard, Paul Bratley, “Fundamentals of Algorithmics”, Prentice Hall Englewood Cliffs New Jersey 07632, 1996
