Skip to search formSkip to main contentSkip to account menu

Deterministic finite automaton

Known as: Local automata, Deterministic finite autonoma, Deterministic finite-state machine 
("DFSA" redirects here. DFSA may also refer to Drug facilitated sexual assault.) In the theory of computation, a branch of theoretical computer… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Alternating finite automatonAutomata theoryAutomatic sequenceChomsky–Schützenberger representation theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and… 
Highly Cited
2008
Highly Cited
2008
Predictability of European air quality: Assessment of 3 years of operational forecasts and analyses by the PREV'AIR system
For the first time, the long-term evaluation of an operational real-time air quality forecasting and analysis system is presented… 
Highly Cited
2007
Highly Cited
2007
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques… 
Highly Cited
2006
Highly Cited
2006
Dynamic framed slotted ALOHA algorithms using fast tag estimation method for RFID system
We propose the ALOHA-based Dynamic Framed Slotted ALOHA algorithm (DFSA) using proposed Tag Estimation Method (TEM) which… 
Highly Cited
2000
Highly Cited
2000
Natural Language Grammatical Inference with Recurrent Neural Networks
This paper examines the inductive inference of a complex grammar with neural networks and specifically, the task considered is… 
Highly Cited
1997
Highly Cited
1997
Intrusion Detection via System Call Traces
Unusual behavior in computer systems can be detected by monitoring the system calls being executed by programs. Analysis of the… 
Highly Cited
1996
Highly Cited
1996
Constructing deterministic finite-state automata in recurrent neural networks
Recurrent neural networks that are <italic>trained</italic> to behave like deterministic finite-state automata (DFAs) can show… 
Highly Cited
1994
Highly Cited
1994
The State Complexities of Some Basic Operations on Regular Languages
Highly Cited
1990
Highly Cited
1990
Prediction-Preserving Reducibility
Highly Cited
1978
Highly Cited
1978
On the power of the compass (or, why mazes are easier to search than graphs)
  • M. BlumD. Kozen
  • 19th Annual Symposium on Foundations of Computer…
  • 1978
  • Corpus ID: 11806648
About the same time, A.N. Shah gave a finite autom~ton with 5 pebbles which could search an arbitrary maze (the autonlaton may… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)