Fujimoto Takumi
An Application of Colored Finite Automata to Intrusion Detection Systems
大島商船高等専門学校紀要 Volume 58
Page 1-7
published_at 2026-03
Title
色付き有限オートマトンの侵入検知システムへの応用
An Application of Colored Finite Automata to Intrusion Detection Systems
Source Identifiers
[PISSN] 0387-9232
[NCID] AN00031668
Creator Keywords
Finite Automata
Regular Expressions
Intrusion Detection System
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.
Resource Type
departmental bulletin paper
Publishers
National Institute of Technology,Oshima College
Date Issued
2026-03
Access Rights
open access
Relations
[ISSN]0387-9232
[NCID]AN00031668

