Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques… Expand

Highly Cited

2006

Highly Cited

2006

Packet content scanning at high speed has become extremely important due to its applications in network security, network… Expand

Highly Cited

1999

Highly Cited

1999

enter the circuit several times, possibly via different input processors. More elaborate combinatorial considerations than for… Expand

Highly Cited

1996

Highly Cited

1996

We introduce a notion of a partial derivative of a regular expression. It is a generalization to the non-deterministic case of… Expand

Highly Cited

1994

Highly Cited

1994

In this paper, we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also… Expand

Highly Cited

1993

Highly Cited

1993

Finite automata (FA’s) are of fundamental importance in theory and in applications. The following basic minimization problem is… Expand

Highly Cited

1990

Highly Cited

1990

We investigate a model of polynomial-time concept prediction which is a relaxation of the distribution-independent model of… Expand

Highly Cited

1988

Highly Cited

1988

Abstract A procedure presented here generates test sequences for checking the conformity of an implementation to the control… Expand

Highly Cited

1985

Highly Cited

1985

Let a partial deterministic finite automaton be a DFA in which each state need not have a transition edge for each letter of the… Expand

Highly Cited

1971

Highly Cited

1971

The bounds on state-set size in the proofs of the equivalence between nondeterministic and deterministic finite automata and… Expand