This preview shows page 1. Sign up to view the full content.
Unformatted text preview: i and s j such that i!=j. By (2), it is observable that s i cannot be the same state as s j because when M is in state s i , it accepts the suffix b i while when it is in state s j it rejects the suffix b i . Consequently each s n is a unique state. Since there are an infinite number of s n 's and each of them are unique states, the machine M must have an infinite number of states. However, this contradicts with our initial assumption that M is a DFA therefore our initial assumption cannot be true. Hence there is no DFA that decides the language L....
View Full Document
This note was uploaded on 12/27/2011 for the course CMPSC 225 taught by Professor Vandam during the Fall '09 term at UCSB.
- Fall '09