Thinkycap logo
Worksheets

Theory of Computation

Bachelor of Science in Computer Science · University · Core Courses

In this unit you will: understand alphabets, strings, and finite automata; distinguish regular and context-free languages; know Turing machines, the halting problem, and decidability; classify big-O, P, NP, and NP-completeness; analyze automata, languages, and problems.

There are 50 exercises to practice: interaktive Aufgaben. Every answer gets instant feedback, free and without signing up.

Practice nowTheory of ComputationBachelor of Science in Computer Science · University · Core Courses · 50 exercisesPractice now

What's included

  • Understand alphabets · strings · and finite automata
  • Distinguish regular and context-free languages
  • Know Turing machines · the halting problem · and decidability
  • Classify big-O · P · NP · and NP-completeness
  • Analyze automata · languages · and problems

Example questions

  1. How many strings of length 3 are there over the alphabet {a, b}?
  2. True or false? “The concatenation of ab and ba is abba.”
  3. What is the length of the empty string ε?

Solve these and more questions now →

More topics in Core Courses