Limitations of DFA’s

• Cannot recognize 0n1n, palindromes

• Only a finite number of states, so it can’t count.

• We can actually characterize what languages DFA’s recognize exactly

  • Called regular languages

Previous slide

Next slide

Back to first slide

View graphic version