Our site uses cookies. Some of the cookies we use are essential for parts of the site to operate and have already been set. You may delete and block all cookies from this site, but parts of the site will not work. To find out more about cookies on this website, see our Cookie Policy

Your browser does not appear to have javascript enabled. This page needs JavaScript activated to work properly. Please enable javascript or choose a different browser (Chrome or Safari)

This test is run by .
Note that your final mark will not be saved in the system.

6 - Regular Languages Wipeout

Target Level

Running Total

For this question there are 5 correct answers. For each correct answer you will score 1 mark.
Be careful, if you get one wrong you are wiped out!

Which of the following input strings are valid according to the finite state machine shown?

Good luck! For each correct answer you get 1 mark.

Pass Mark

75%