String matching is a fundamental problem in computer science that consists of finding the occurrence of a pattern within a larger text. This problem appears in many real-world applications such as ...

Abstract: Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additional ...

Abstract: The regular expression matching algorithm (REM) is widely applied in the deep packet inspection(DPI), which is more flexible and efficient compared with conventional exact matching algorithm ...

This project applies Formal Language and Automata Theory to efficiently identify DNA motifs in biological sequences. Motifs are converted into NFAs, transformed into DFAs using subset construction, ...