The Experts below are selected from a list of 5898 Experts worldwide ranked by ideXlab platform
Geza Szabo - One of the best experts on this subject based on the ideXlab platform.
-
deterministic finite automaton for scalable traffic identification: The power of compressing by range
Proceedings of the 2012 IEEE Network Operations and Management Symposium, NOMS 2012, 2012Co-Authors: Riccardo Antonello, Stenio Fernandes, Djamel Sadok, Judith Kelner, Geza SzaboAbstract:Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching through the use of finite automaton (FA). Although DPI systems are essentially more accurate, they are also resource-intensive and do not scale well with link speeds. Looking to this area of interest, this paper proposes a novel deterministic finite automaton, called Ranged Compressed deterministic finite automaton (RCDFA), that compresses transitions without additional memory lookups. Experimental results show that RCDFA yields space savings of 97% over the original DFA and up to 93% better compression when compared to the DFA's state-of-the-art compression techniques.
-
NOMS - deterministic finite automaton for scalable traffic identification: The power of compressing by range
2012 IEEE Network Operations and Management Symposium, 2012Co-Authors: Riccardo Antonello, Stenio Fernandes, Djamel Sadok, Judith Kelner, Geza SzaboAbstract:Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching through the use of finite automaton (FA). Although DPI systems are essentially more accurate, they are also resource-intensive and do not scale well with link speeds. Looking to this area of interest, this paper proposes a novel deterministic finite automaton, called Ranged Compressed deterministic finite automaton (RCDFA), that compresses transitions without additional memory lookups. Experimental results show that RCDFA yields space savings of 97% over the original DFA and up to 93% better compression when compared to the DFA's state-of-the-art compression techniques.
A.n. Trahtman - One of the best experts on this subject based on the ideXlab platform.
-
precise estimation on the order of local testability of deterministic finite automaton
arXiv: Formal Languages and Automata Theory, 2020Co-Authors: A.n. TrahtmanAbstract:A locally testable language L is a language with the property that for some non negative integer k, called the order or the level of local testable, whether or not a word u in the language L depends on (1) the prefix and the suffix of the word u of length k-1 and (2) the set of intermediate partial strings of length k of the word u. For given k the language is called k-testable. We give necessary and sufficient conditions for the language of an automaton to be k-testable in the terms of the length of paths of a related graph. Some estimations of the upper and of the lower bound of testable order follow from these results. We improve the upper bound on the testable order of locally testable deterministic finite automaton with n states to n(n-2)+1 This bound is the best possible. We give an answer on the following conjecture of Kim, McNaughton and Mac-CLoskey for deterministic finite locally testable automaton with n states: \Is the local testable order of no greater than n in power 1.5 when the alphabet size is two?" Our answer is negative. In the case of size two the situation is the same as in general case.
-
Polynomial time algorithm for left [right] local testability
arXiv: Formal Languages and Automata Theory, 2020Co-Authors: A.n. TrahtmanAbstract:A right [left] locally testable language S is a language with the property that for some non negative integer k two words u and v in alphabet S are equal in the semi group if (1) the prefix and suffix of the words of length k coincide, (2) the set of segments of length k of the words as well as 3) the order of the first appearance of these segments in prefixes [suffixes] coincide. We present necessary and sufficient condition for graph [semi group] to be transition graph [semi group] of the deterministic finite automaton that accepts right [left] locally testable language and necessary and sufficient condition for transition graph of the deterministic finite automaton with locally idempotent semi group. We introduced polynomial time algorithms for the right [left] local testable problem for transition semi group and transition graph of the deterministic finite automaton based on these conditions. Polynomial time algorithm verifies transition graph of automaton with locally idempotent transition semi group.
-
Reducing the time complexity of testing for local threshold testability
Theoretical Computer Science, 2004Co-Authors: A.n. TrahtmanAbstract:AbstractA locally threshold testable language L is a language with the property that for some non-negative integers k and l and for some word u from L, a word v belongs to L iff:(1) the prefixes [suffixes] of length k-1 of words u and v coincide,(2) the number of occurrences of every factor of length k in both words u and v are either the same or greater than l-1.A deterministic finite automaton is called locally threshold testable if the automaton accepts a locally threshold testable language for some l and k.New necessary and sufficient conditions for a deterministic finite automaton to be locally threshold testable are found. On the basis of these conditions, we modify the algorithm to verify local threshold testability of the automaton, and to reduce the time complexity of the algorithm. The algorithm is implemented as a part of the C/C++ package TESTAS. http://www.cs.biu.ac.il/~trakht/Testas.html
-
CIAA - A polynomial time algorithm for left [right] local testability
Implementation and Application of Automata, 2003Co-Authors: A.n. TrahtmanAbstract:A right [left] locally testable language S is a language with the property that for some nonnegative integer k two words u and v in alphabet S are equal in the semigroup if (1) the prefix and suffix of the words of length k -1 coincide, (2) the set of segments of length k of the words as well as 3) the order of the first appearance of these segments in prefixes [suffixes] coincide. We present necessary and sufficient condition for graph [semigroup] to be transition graph [semigroup] of the deterministic finite automaton that accepts right [left] locally testable language and necessary and sufficient condition for transition graph of the deterministic finite automaton with locally idempotent semigroup. We introduced polynomial time algorithms for the right [left] local testability problem for transition semigroup and transition graph of the deterministic finite automaton based on these conditions. Polynomial time algorithm verifies transition graph of automaton with locally idempotent transition semigroup.
-
precise estimation of the order of local testability of a deterministic finite automaton
Lecture Notes in Computer Science, 1998Co-Authors: A.n. TrahtmanAbstract:A locally testable language L is a language with the property that for some nonnegative integer k, called the order or the level of local testability, whether or not a word u in the language L depends on (1) the prefix and suffix of the word u of length k - 1 and (2) the set of intermediate substrings of length k of the word u. For given k the language is called k-testable. We give necessary and sufficient conditions for the language of an automaton to be k-testable in the terms of the length of paths of a related graph. Some estimations of the upper and of the lower bound of order of testability follow from these results. We improve the upper bound on the order of testability of locally testable deterministic finite automaton with n states to n 2 -n/2+1. This bound is the best possible. We give an answer on the following conjecture of Kim, McNaughton and McCloskey for deterministic finite locally testable automaton with n states: Is the order of local testability no greater than Ω(n 1.5 ) when the alphabet size is two? Our answer is negative. In the case of size two the situation is the same as in general case: the order of local testability is Ω(n 2 ).
Riccardo Antonello - One of the best experts on this subject based on the ideXlab platform.
-
deterministic finite automaton for scalable traffic identification: The power of compressing by range
Proceedings of the 2012 IEEE Network Operations and Management Symposium, NOMS 2012, 2012Co-Authors: Riccardo Antonello, Stenio Fernandes, Djamel Sadok, Judith Kelner, Geza SzaboAbstract:Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching through the use of finite automaton (FA). Although DPI systems are essentially more accurate, they are also resource-intensive and do not scale well with link speeds. Looking to this area of interest, this paper proposes a novel deterministic finite automaton, called Ranged Compressed deterministic finite automaton (RCDFA), that compresses transitions without additional memory lookups. Experimental results show that RCDFA yields space savings of 97% over the original DFA and up to 93% better compression when compared to the DFA's state-of-the-art compression techniques.
-
NOMS - deterministic finite automaton for scalable traffic identification: The power of compressing by range
2012 IEEE Network Operations and Management Symposium, 2012Co-Authors: Riccardo Antonello, Stenio Fernandes, Djamel Sadok, Judith Kelner, Geza SzaboAbstract:Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching through the use of finite automaton (FA). Although DPI systems are essentially more accurate, they are also resource-intensive and do not scale well with link speeds. Looking to this area of interest, this paper proposes a novel deterministic finite automaton, called Ranged Compressed deterministic finite automaton (RCDFA), that compresses transitions without additional memory lookups. Experimental results show that RCDFA yields space savings of 97% over the original DFA and up to 93% better compression when compared to the DFA's state-of-the-art compression techniques.
Gatis Midrijanis - One of the best experts on this subject based on the ideXlab platform.
-
The Complexity of Probabilistic versus Quantum finite Automata
arXiv: Quantum Physics, 2003Co-Authors: Gatis MidrijanisAbstract:We present a language $L_n$ which is recognizable by a probabilistic finite automaton (PFA) with probability $1 - \epsilon$ for all $\epsilon > 0$ with $O(log^2n)$ states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least $2^{\Omega(n/ \log n)}$ states.
-
SOFSEM - The Complexity of Probabilistic versus Quantum finite Automata
SOFSEM 2002: Theory and Practice of Informatics, 2002Co-Authors: Gatis MidrijanisAbstract:We present a language Ln which is recognizable by a probabilistic finite automaton (PFA) with probability 1 - ? for all ? > 0 with O(log2 n) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least 2?(n/log n) states.
Stenio Fernandes - One of the best experts on this subject based on the ideXlab platform.
-
deterministic finite automaton for scalable traffic identification: The power of compressing by range
Proceedings of the 2012 IEEE Network Operations and Management Symposium, NOMS 2012, 2012Co-Authors: Riccardo Antonello, Stenio Fernandes, Djamel Sadok, Judith Kelner, Geza SzaboAbstract:Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching through the use of finite automaton (FA). Although DPI systems are essentially more accurate, they are also resource-intensive and do not scale well with link speeds. Looking to this area of interest, this paper proposes a novel deterministic finite automaton, called Ranged Compressed deterministic finite automaton (RCDFA), that compresses transitions without additional memory lookups. Experimental results show that RCDFA yields space savings of 97% over the original DFA and up to 93% better compression when compared to the DFA's state-of-the-art compression techniques.
-
NOMS - deterministic finite automaton for scalable traffic identification: The power of compressing by range
2012 IEEE Network Operations and Management Symposium, 2012Co-Authors: Riccardo Antonello, Stenio Fernandes, Djamel Sadok, Judith Kelner, Geza SzaboAbstract:Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching through the use of finite automaton (FA). Although DPI systems are essentially more accurate, they are also resource-intensive and do not scale well with link speeds. Looking to this area of interest, this paper proposes a novel deterministic finite automaton, called Ranged Compressed deterministic finite automaton (RCDFA), that compresses transitions without additional memory lookups. Experimental results show that RCDFA yields space savings of 97% over the original DFA and up to 93% better compression when compared to the DFA's state-of-the-art compression techniques.