• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.783-798
• /
• 1999

Nondeterministic finite Rabin-Scott's automata without initial and final states (2 $\omega$-FA) are considered. In this paper they are used to define so called sets of obstruction used also in various alge-braic systems and to consider similar problems for the formal languages theory. Thus we define sets of obstructions of languages(or, rather, 2$\omega$-languages) of such automata. We obtain that each 2$\omega$-language defined by 2 $\omega$-FA has the set of obstruction being a regular language. And vice versa for each regular language L(containing no proper subword of its another word) there exists a 2$\omega$ -FA having L as the set of obstructions.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.147-154
• /
• 2023

Network intrusion refers to any unauthorized penetration or activity on a computer network. This upsets the confidentiality, integrity, and availability of the network system. One of the major threats to any system's availability is a Denial-of-Service (DoS) attack, which is intended to deny a legitimate user access to resources. Therefore, due to the complexity of DoS attacks, it is increasingly important to abstract and describe these attacks in a way that will be effectively detected. The automaton theory is used in this paper to implement a SYN Flood detection system based on Time-Dependent Finite Automata (TDFA).