Implementation of String Matching Algorithm with Finite Automata in The Indonesian-Korean Dictionary Application

Abstract

Foreign languages become a connection both in terms of communication, association, culture, and science in the digital era. One of these languages is the Korean language, which has gained significant popularity among Indonesian people. However, learning the Korean language can be challenging due to its distinct alphabet compared to the Indonesian alphabet. Therefore, the user-friendly dictionary is needed for Indonesian people, namely the Indonesian-Korean Dictionary based on Android platform. This dictionary implements Finite Automata for string searching. The system matches the user's input string with the strings in the database. The output of this application includes the matched words and the search time. Based on the results of 10 tests system using Finite Automata, the system's efficiency in processing search patterns showing the average running time is 15.8 ms. Additionally, after conducting an in-depth analysis of the algorithm's time complexity, it was confirmed to have a time complexity of O(n3). This demonstrates that the system successfully matches strings effectively and produces reliable results.