# Deterministic finite automaton

## Papers overview

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

2010

2010

- Eighth ACM/IEEE International Conference on…
- 2010

This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To… (More)

Is this relevant?

2009

2009

- 12th Euromicro Conference on Digital System…
- 2009

As the speed of current computer networks increases, it is necessary to protect networks by security systems such as firewalls… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- CoNEXT
- 2007

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

Is this relevant?

2006

2006

- Journal of Computational Biology
- 2006

BLAST is the most popular bioinformatics tool and is used to run millions of queries each day. However, evaluating such queries… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Proceedings. IEEE International Conference on Web…
- 2004

Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- ACM Trans. Database Syst.
- 2004

We consider the problem of evaluating a large number of XPath expressions on a stream of XML packets. We contribute two novel… (More)

Is this relevant?

1998

1998

- ICGI
- 1998

@BA C DFEHG DFIKJML7NPO)Q9RSDTJ!UWV X IKCZY;[WR\X]N ^ A`_aCZJcb [WC UdV @)N e [W[gf)DTRS[KE U"h i U j k @?l [KEH[mIdC"n"A!opJ E… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Theor. Comput. Sci.
- 1996

We introduce a notion of partial derivative of a regular expression and apply it to finite automaton constructions. The notion is… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- J. ACM
- 1996

Recurrent neural networks that are <italic>trained</italic> to behave like deterministic finite-state automata (DFAs) can show… (More)

Is this relevant?

Highly Cited

1971

Highly Cited

1971

- IEEE Transactions on Computers
- 1971

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

Is this relevant?