** Next:** Determinization
** Up:** Operations on recognizers
** Previous:** Operations on recognizers

An important and powerful operation is intersection. In the classical
case, an automaton for the intersection of the languages defined by
two given automata *M*_{1} and *M*_{2} is constructed by considering the
cross product of states of *M*_{1} and *M*_{2}. A transition
exists iff the corresponding transition
exists in *M*_{1} and
exists in
*M*_{2}. In the case of pfsr a similar construction can be used, but
instead of requiring that the symbol occurs in the
corresponding transitions of *M*_{1} and *M*_{2}, we require that the
resulting predicate is the conjunction of the corresponding predicates
in *M*_{1} and *M*_{2}. The same technique is described in [35].
Given -free pfsr
and
, the intersection
is the language accepted by
and
.

*Noord G.J.M. van*

*2001-06-22*