Results 241 to 250 of about 23,120 (273)
Some of the next articles are maybe not open access.
2013
Recently, Dassow et al. connected partial words and regular languages. Partial words are sequences in which some positions may be undefined, represented with a "hole" symbol ⋄. If we restrict what the symbol ⋄ can represent, we can use partial words to compress the representation of regular languages.
Eric Balkanski +3 more
openaire +1 more source
Recently, Dassow et al. connected partial words and regular languages. Partial words are sequences in which some positions may be undefined, represented with a "hole" symbol ⋄. If we restrict what the symbol ⋄ can represent, we can use partial words to compress the representation of regular languages.
Eric Balkanski +3 more
openaire +1 more source
SRD-DFA: Achieving Sub-rule Distinguishing with Extended DFA Structure
2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009Deep Packet Inspection (DPI) relies highly on regular expression due to its power of description, generalization and flexibility. In DPI, packet payload is compared against a large number of rules written in regular expression. To achieve high throughput, multiple regular expressions are combined and compiled into one DFA, which leads to two problems ...
Gao Xia, Xiaofei Wang 0006, Bin Liu 0001
openaire +1 more source
2005
In this paper we describe two different DFA attacks on the AES. The first one uses a fault model that induces a fault on only one bit of an intermediate result, hence allowing us to obtain the key by using 50 faulty ciphertexts for an AES-128. The second attack uses a more realistic fault model: we assume that we may induce a fault on a whole byte. For
openaire +1 more source
In this paper we describe two different DFA attacks on the AES. The first one uses a fault model that induces a fault on only one bit of an intermediate result, hence allowing us to obtain the key by using 50 faulty ciphertexts for an AES-128. The second attack uses a more realistic fault model: we assume that we may induce a fault on a whole byte. For
openaire +1 more source
DFA minimization in map-reduce
Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2016We describe Map-Reduce implementations of two of the most prominent DFA minimization methods, namely Moore's and Hopcroft's algorithms. Our analysis shows that the one based on Hopcroft's algorithm is more efficient, both in terms of running time and communication cost.
Gösta Grahne +3 more
openaire +1 more source
The query complexity of learning DFA
New Generation Computing, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José L. Balcázar +3 more
openaire +2 more sources
DFA with a Bounded Activity Level
2014Lookahead DFA are used during parsing for sake of resolving conflicts as described in more detail in the introduction. The parsing of an input string w may require many DFA-explorations starting from different letter positions. This raises the question how many of these explorations can be active at the same time.
Marius Konitzer, Hans Ulrich Simon
openaire +1 more source
Degrees of Reversibility for DFA and DPDA
2014The notion of k-reversibility is generalized to pushdown automata. A pushdown automaton is said to be (k,l)-reversible if its predecessor configurations can uniquely be computed by a pushdown automaton with input lookahead of size k and stack lookahead of size l.
Martin Kutrib, Thomas Worsch
openaire +1 more source
Some Aspects of Synchronization of DFA
Journal of Computer Science and Technology, 2008A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automata (DFA) if w brings all states of the automaton to a unique state. According to the famous conjecture of Cerný from 1964, every n-state synchronizing automaton possesses a synchronizing word of length at most (n–1)2. The problem is still open. It will be
openaire +1 more source
A Parallel DFA Minimization Algorithm
2002In this paper, we have considered the state minimization problem for Deterministic Finite Automata (DFA). An efficient parallel algorithm for solving the problem on an arbitrary CRCW PRAM has been proposed. For n number of states and k number of inputs in ?
Ambuj Tewari +2 more
openaire +1 more source