Conversion of Decision Tree Into Deterministic Finite Automaton for High Accuracy Online SYN Flood Detection

Iwama et al. showed that there exists an n-state binary nondeterministic finite automaton such that its equivalent minimal deterministic finite automaton has exactly 2n - α states, for all n ≥ 7 and 5 ≤ α ≤ 2n-2, subject to certain coprimality conditions. We investigate the same question for both unary and binary symmetric difference nondeterministic finite automata. In the binary case, we show that for any n ≥ 4, there is an n-state symmetric difference nondeterministic finite automaton for which the equivalent minimal deterministic finite automaton has 2n - 1 + 2k - 1 - 1 states, for 2 < k ≤ n - 1. In the unary case, we consider a large practical subclass of unary symmetric difference nondeterministic finite automata: for all n ≥ 2, we argue that there are many values of α such that there is no n-state unary symmetric difference nondeterministic finite automaton with an equivalent minimal deterministic finite automaton with 2n - α states, where 0 < α < 2n - 1. For each n ≥ 2, we quantify such values of α precisely.

Download Full-text

State Complexity of Suffix Distance

International Journal of Foundations of Computer Science ◽

10.1142/s0129054119400355 ◽

2019 ◽

Vol 30 (06n07) ◽

pp. 1197-1216

Author(s):

Timothy Ng ◽

David Rappaport ◽

Kai Salomaa

Keyword(s):

Lower Bound ◽

Finite Automaton ◽

Regular Language ◽

Upper Bounds ◽

The State ◽

Deterministic Finite Automaton ◽

Tight Bound ◽

State Complexity

The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of the neighbourhood of radius [Formula: see text] of an [Formula: see text]-state deterministic finite automaton language with respect to the suffix distance and the subword distance, respectively. For restricted values of [Formula: see text] and [Formula: see text] we give a matching lower bound for the state complexity of suffix distance neighbourhoods.

Download Full-text

Deterministic automata for extended regular expressions

Open Computer Science ◽

10.1515/comp-2017-0004 ◽

2017 ◽

Vol 7 (1) ◽

pp. 24-28

Author(s):

Mirzakhmet Syzdykov

Keyword(s):

Finite Automaton ◽

Regular Languages ◽

Regular Expressions ◽

Deterministic Finite Automaton ◽

Past Work ◽

The Past ◽

Deterministic Automata ◽

Extended Regular Expressions

Abstract In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like “overriding” of the source NFA(NFA not defined) with subset construction rules is used. The past work described only the algorithm for AND-operator (or intersection of regular languages); in this paper the construction for the MINUS-operator (and complement) is shown.

Download Full-text

Multimedia learning machine based on non-deterministic finite automaton

2010 2nd International Conference on Computer Engineering and Technology ◽

10.1109/iccet.2010.5485754 ◽

2010 ◽

Author(s):

Wei-feng Shan ◽

Ji-lin Feng

Keyword(s):

Finite Automaton ◽

Multimedia Learning ◽

Deterministic Finite Automaton ◽

Learning Machine

Download Full-text

Automaticity of primitive words and irreducible polynomials

Discrete Mathematics & Theoretical Computer Science ◽

10.46298/dmtcs.632 ◽

2013 ◽

Vol Vol. 15 no. 1 (Automata, Logic and Semantics) ◽

Author(s):

Anne Lacroix ◽

Narad Rampersad

Keyword(s):

Finite Field ◽

Finite Automaton ◽

Prime Numbers ◽

Deterministic Finite Automaton ◽

Irreducible Polynomials ◽

Letter Alphabet ◽

International Audience ◽

Primitive Words

Automata, Logic and Semantics International audience If L is a language, the automaticity function A_L(n) (resp. N_L(n)) of L counts the number of states of a smallest deterministic (resp. non-deterministic) finite automaton that accepts a language that agrees with L on all inputs of length at most n. We provide bounds for the automaticity of the language of primitive words and the language of unbordered words over a k-letter alphabet. We also give a bound for the automaticity of the language of base-b representations of the irreducible polynomials over a finite field. This latter result is analogous to a result of Shallit concerning the base-k representations of the set of prime numbers.

Download Full-text

ON A SUPERCLASS OF A-GRAMMARS

Vestnik of Samara University Natural Science Series ◽

10.18287/2541-7525-2014-20-10-102-108 ◽

2017 ◽

Vol 20 (10) ◽

pp. 102-108

Author(s):

V.P. Tsvetov

Keyword(s):

Finite Automaton ◽

Formal Languages ◽

Regular Languages ◽

Finite Alphabet ◽

Graph Structure ◽

Graph Grammars ◽

Deterministic Finite Automaton

In this paper we consider a superclass of automaton grammars that can be represented in terms of paths on graphs. With this approach, we assume that vertices of graph are labeled by symbols of ﬁnite alphabet A . We will call such grammars graph-generated grammars or G-grammars. In contrast to the graph grammars that are used to describe graph structure transformations, G-grammars using a graphs as a means of representing formal languages. We will give an algorithm for constructing G-grammar which generate the language recognized by deterministic ﬁnite automaton. Moreover, we will show that the class of languages generated by G-grammars is a proper superset of regular languages.

Download Full-text