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.
2012
2012
Size complexity of rotating and sweeping automata
2009
2009
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
As the speed of current computer networks increases, it is necessary to protect networks by security systems such as firewalls… 
2007
2007
Modeling the Regular Constraint with Integer Programming
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can… 
2007
2007
Head pose tracking and gesture detection using block motion vectors on mobile devices
We present a novel and practical algorithm for head pose tracking and head gesture detection applicable to avatar applications… 
2006
2006
Notable trends concerning the synchronization of graphs and automata
  • A. Trakhtman
  • Electron. Notes Discret. Math.
  • 2006
  • Corpus ID: 30210886
Highly Cited
1999
Highly Cited
1999
ADVANCED FAILURE MODES AND EFFECTS ANALYSIS OF COMPLEX PROCESSES
This paper presents the use of Advanced Failure Modes and Effects Analysis (AFMEA) as a methodology to analyze manufacturing… 
1998
1998
Enhanced product realisation through modular design: an example of product/process integration
The success of new products in the market place depends upon timeliness, cost effectiveness and quality. The realisation of such… 
1994
1994
Implication Problems for Functional Constraints on Databases Supporting Complex Objects
1982
1982
A Deterministic Finite Automaton Approach to Design Rule Checking for VLSI
Integrated circuit fabrication technologies place certain restrictions on the relationships with and between mask layers. These… 
1978
1978
On The Difference Between Natural Language And High Level Query Languages
Natural Language questions differ from most existing formal query languages in that they tend to admit a wider range of responses… 
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)