Regular Language
Regular Language. Class Discussion. Can you draw a DFA that accepts the language {a k b k | k = 0,1,2,… } over the alphabet ={a,b}?. Limitations of FA. Many languages are non-regular: {a n b n | n = 0,1,2,… } {0 i 2 | i 0,1,2,…} {0 p | p is a prime number }
415 views • 28 slides