| Finite Automata | ||
| Language Accepted or Recognized by a DFA :
The language accepted or recognized by a DFA M is the set of all strings accepted by M , and is denoted by The notion of acceptance can also be made more precise by extending the transition function |
||