Skills101
← All practice quizzes

Quiz: TOC Basics

5 questionsNo time limitPass: 60%+10 XP on first pass

The vocabulary of TOC — alphabets, strings, length, concatenation, Kleene star and languages — why we study machines that recognise languages, and the Chomsky hierarchy mapping regular, context-free, context-sensitive and recursively enumerable languages to their machines.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    How many strings of length at most 3 are there over Σ = {0, 1} (including ε)?

  2. Question 2

    What is the difference between ε and ∅?

  3. Question 3

    Which machine recognises context-free languages?

  4. Question 4

    If L = {ab}, which string is in L*?

  5. Question 5

    Why can't a regular expression match arbitrarily deeply nested brackets?