Validasi Dokumen Pengajuan Penelitian dan Pengabdian Masyarakat Universitas Nasional Menggunakan Metode Finite State Automata

  • Dwi Yulianto L
  • Gata W
  • Frieyadie
  • et al.
N/ACitations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Dwi Yulianto, L., Gata, W., Frieyadie, & Saputra, D. D. (2022). Validasi Dokumen Pengajuan Penelitian dan Pengabdian Masyarakat Universitas Nasional Menggunakan Metode Finite State Automata. Jurnal JTIK (Jurnal Teknologi Informasi Dan Komunikasi), 6(4), 497–504. https://doi.org/10.35870/jtik.v6i4.520

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free