Deterministic finite automaton - Definition
In the theory of computation, ...
finite automaton an automaton (abstract computer) that is organized as a transition network, where transitions between nodes are labeled by input symbols.
Renji TAO: "On Finite Automaton One-Key Cryptosystems", Fast Software Encryption Cambridge Security Workshop., Springer Verlang, 1994, pp. 135-148; ...
In this approach, we avoid backtracking by constructing a deterministic finite automaton (DFA) that recognizes strings containing the desired search string.
A Turing Machine can be represented as a deterministic finite automaton. For example, below is an NFA representation of a Turing Machine that accepts the regular expression 'aba*'.
 See also: Alpha
  
|
RSS
