Ask your own question, for FREE!
Computer Science 18 Online
OpenStudy (anonymous):

languages that no DFAs can accept

OpenStudy (anonymous):

palindrome

OpenStudy (anonymous):

language consisting of strings of the form anbn—some finite number of a's, followed by an equal number of b's.

OpenStudy (anonymous):

some times when n number of recursion occurs..i may not accept

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!