Main Article Content
Non-Deterministic Finite Automata (NFA), a form of Finite State Automata (FSA), is one method for validating research proposal documents in R&D and community service activities at national universities. To carry out these activities, it is necessary to monitor the research proposal documents submitted by lecturers/researchers, one of which is to validate the research proposal document, ensuring that it follows the guidelines and avoids plagiarism, as well as the theme's suitability with the research proposal document's contents. Members of the research team can only participate in one type of study: stimulation or competitive research. Reviewers can provide research members with notes and plagiarism information, as well as refuse to submit research proposals. If the research proposal document is approved by the reviewer, the research member will receive a research certificate and will be able to continue their research with full support from the national government.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The Authors submitting a manuscript do so on the understanding that if accepted for publication, copyright of the article shall be assigned to JTIK journal and Research Division, KITA Institute as the publisher of the journal. Copyright encompasses rights to reproduce and deliver the article in all form and media, including reprints, photographs, microfilms, and any other similar reproductions, as well as translations.Â
JTIK journal and Research Division, KITA Institute and the Editors make every effort to ensure that no wrong or misleading data, opinions or statements be published in the journal. In any way, the contents of the articles and advertisements published in JTIK journal are the sole and exclusive responsibility of their respective authors and advertisers.
TheÂ Copyright Transfer FormÂ can be downloaded here: [Copyright Transfer Form JTIK].Â The copyright form should be signed originally and send to the Editorial Office in the form of original mail, scanned document or fax :Â Â
Taufiq Iqbal (Editor-in-Chief)
Editorial Office of Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi)
Research Division, KITA Institute
Teuku Nyak Arief Street Nomor : 7b, Lamnyong, Lamgugop, Kota Banda Aceh
Email:Â firstname.lastname@example.org - email@example.com
DWicaksono, D.W., Irawan, M.I. and Rukmi, A.M., 2014. Sistem Deteksi Kemiripan Antar Dokumen Teks Menggunakan Model Bayesian Pada Term Latent Semantic Analysis (LSA). Jurnal Sains dan Seni ITS, 3(2), pp.A40-A45.
Tantra, P.A, Pakereng I.A.M., 2018. Validasi Sistem Pengajuan Akreditasi atau Reakreditasi Program Studi Berbasis Website Pada LPMAI UKSW Menggunakan Finite State Automata. Theses. Universitas Kristen Satya Wacana Salatiga.
ADE, R., 2019. Penerapan Metode Word2vec Untuk Mendeteksi Kemiripan Dokumen (Doctoral dissertation, Institut Telkom Purwokerto).
Manu, G. and Tantrisna, E., 2020. Perancangan Aplikasi Monitoring Penelitian Dan Pengabdian Masyarakat Internal Perguruan Tinggi. Jurnal Pendidikan Teknologi Informasi (JUKANTI), 3(2), pp.48-55.
AbuSafiya, M., 2020, February. Measuring Documents Similarity using Finite State Automata. In 2020 2nd International Conference on Mathematics and Information Technology (ICMIT) (pp. 208-211). IEEE.
Sitaula, C. and Yadav, R.O., 2013. Semantic Sentence Similarity Using Finite State Machine. Intelligent Information Management, 5(6), p.171.
Priyanto, A., 2010. Aplikasi Pencocokan String Dengan Metode Finite Automata. Media Aplikom, 1(3), pp.157-165.
Rivanie, T. and Alkalifi, Y., 2020. Implementasi Finite State Automata dalam Proses Registrasi Workout Plan pada Pusat Kebugaran. MATICS, 12(1), pp.94-98.
Khalid, A., Sen, R. and Chattopadhyay, A., 2013, July. Si-dfa: Sub-expression integrated Deterministic Finite Automata for deep packet inspection. In 2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) (pp. 164-170). IEEE.
Nourian, M., Wu, H. and Becchi, M., 2018, December. A Compiler Framework for Fixed-Topology Non-Deterministic Finite Automata on SIMD Platforms. In 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) (pp. 507-516). IEEE.
Supriyanto, E., Ardiansyah, A., Frieyadie, F., Rahayu, S. and Gata, W., 2021. Penerapan Finite State Automata Pada Vending Machine Penjual Obat Non Resep Dokter Dan Keperluan Medis. Jurnal Informasi dan Komputer, 9(2), pp.08-14.
Wei-feng, S. and Ji-lin, F., Multimedia learning machine based on non-deterministic finite automaton. In 2010 2nd International Conference on Computer Engineering and Technology.
Rehman, A., Latif, S. and Zafar, N.A., 2019, March. Formal Modeling of Smart office using Activity Diagram and Non Deterministic Finite Automata. In 2019 International Conference on Information Science and Communication Technology (ICISCT) (pp. 1-5). IEEE.