Deterministic Finite State Machine: Advantages And Disadvantages
Related Resources : Deterministic Finite State Machine
Advantages And Disadvantages
DFAs were invented to model real world finite state machines in contrast to
real world machines.DFAs are one of the most practical models of computation, since there is a trivial linear time, constant-space, online algorithm to simulate a DFA on a stream of input. Also, there are efficient algorithms to find a DFA recognizing:
On the other hand, finite state automata are of strictly limited power in the languages they can recognize; many simple languages, including any problem that requires more than constant space to solve, cannot be recognized by a DFA. The classical example of a simply described language that no DFA can recognize is
Another simpler example is the language consisting of strings of the form anbn—some finite number of a's, followed by an equal number of b's.
Other Relevant or Related Items
19 Related Topics about Deterministic finite state machineAcyclic deterministic finite automata .. Drug facilitated sexual assault .. Monadic second-order logic .. Quantum finite automata .. Read-only right moving Turing Machines .. Turing machine .. Two-way deterministic finite automaton .. automata theory .. directed graph .. finite state machine .. minimal DFAs .. nondeterministic finite automata .. online algorithm .. powerset construction .. recursion .. regular language .. state diagram .. theoretical computer science .. vertex set ..