Finite-state machines have been used in various domains of natural language processing.
We consider here the use of a type of transducer that supports very efficient programs …

Application-level protocol specifications are useful for many security applications, including
intrusion prevention and detection that performs deep packet inspection and traffic …

This paper describes a global constraint on a fixed-length sequence of finite-domain
variables requiring that the corresponding sequence of values taken by these variables …

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-
state automata from a set of strings. Traditional methods consist of two phases: the first to …

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 …

There are several algorithms for producing the canonical DFA from a given NFA. While the
theoretical complexities of these algorithms are known, there has not been a systematic …

In this book we present a number of techniques leading to the automated generation of
checker circuits from modern hardware assertion languages. Today, verification takes over …

Ordinary software engineers and programmers can easily understand regular patterns, as
shown by the immense interest in and the success of scripting languages like Perl, based …

Abstract Model-based diagnosis has always been conceived as set-oriented, meaning that a
candidate is a set of faults, or faulty components, that explains a collection of observations …

This third edition updates, enriches, and revises the 2013 printing [1], without dulling the
original structure of the book. The selection of materials and the presentation style reflect …