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.
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
- How many strings of length 3 are there over the alphabet {a, b}?
- True or false? “The concatenation of ab and ba is abba.”
- What is the length of the empty string ε?