Symbolic Automata extend classical automata by using symbolic alphabets instead of finite
ones. Most of the classical automata algorithms rely on the alphabet being finite, and …

This dissertation is concerned with finite state machine-based technology for modeling
natural language. Finite-state machines have proven to be efficient computational devices in …

We introduce ZIDS, a client-server solution for private detection of intrusions that is suitable
for private detection of zero-day attacks in input data. The system includes an intrusion …

Abstract Regular Expression Matching (REM) is the core of Deep Packet Inspection (DPI),
which is important for various network security applications. The burgeoning Software …

Apart from the theoretical worst-case running time analysis not much is known about the
average-case analysis or practical performance of finite automata minimization algorithms …

Identifying live and dead states in an abstract transition system is a recurring problem in
formal verification; for example, it arises in our recent work on efficiently deciding regex …

We present different techniques for reducing the number of states and transitions in
nondeterministic automata. These techniques are based on the two preorders over the set of …

This thesis is submitted in partial fulfillment of the requirements for the degree of Doctor of
Philosophy (Ph. D) in the FASTAR group of the Department of Computer Science, University …

There exists a linear time algorithm for the minimization of acyclic deterministic finite-state
automata (ADFA) due to Dominique Revuz [17]. The algorithm has different phases …

A finite automaton can be either deterministic (DFA) or nondeterministic (NFA). An
automaton‐based task is in general more efficient when performed with a DFA rather than …