In recent years, colored finite automata (CFA), an extension of finite automata, have been proposed, and we are investigating their application to intrusion detection systems (IDS). By assigning “colors” to states, CFAs enable more detailed and multi-layered input identification beyond the binary accept/reject decisions of conventional automata. This research first implements an IDS utilizing these CFA. Subsequently, we aim to evaluate its attack detection accuracy using experimental data and demonstrate the usefulness of CFA-based IDS.
Finite Automata
Regular Expressions
Intrusion Detection System