THEORETICAL COMPUTER SCIENCE · EXAM · 1:1
Four to five sessions before the exam. We construct automata, practise the pumping lemma and place computability and complexity, until the proof routines stick.
Anton LIVE B.Sc. Computer Science · Theory responds ≤ 2 h , View profile Free first chat →
Already decided? Straight to a session →
Live from a theoretical CS session
# DFA: even number of 1s States: q0 (start, accepting), q1 0: q0 -> q0, q1 -> q1 1: q0 -> q1, q1 -> q0 # every 1 flips the side
Theoretical computer science tests constructions and proofs, not programming. Typical is an automata block (regular languages), a grammar block (context-free, pumping lemma) and a block on computability and complexity. We drill each on your past papers.
Pay per session or grab an exam package. The intro call is free: if it is not a fit, you have lost nothing.
No memorised solution. We construct the automaton via the question each state answers, the way you have to justify it in the exam.
Construct a DFA over the alphabet {0, 1} that accepts exactly the words with an even number of 1s.
# Two states suffice q0 = even number of 1s (start, accepting) q1 = odd number of 1s Transitions: 0: q0 -> q0, q1 -> q1 # 0 changes nothing 1: q0 -> q1, q1 -> q0 # 1 flips
Two states suffice: q0 counts even, q1 odd numbers of 1s, and q0 is both the start and the accepting state.
What must the automaton remember? Only whether it has seen an even or odd number of 1s so far. That is exactly two states, q0 and q1.
A 0 does not change the parity, so the state stays. A 1 flips from even to odd and back, so the state switches between q0 and q1.
Zero 1s is an even count, so q0 is both the start and the accepting state. The DFA accepts exactly when it ends in q0 after the last symbol.
Choose states as the question the automaton must remember. A few states are usually enough if you frame the question small enough.
That is exactly what we practise in your session: constructing an automaton step by step instead of guessing.
Start now and invest 4 to 5 sessions and your chances are good. Less time? We compress. More? We go deeper, into further reductions or Rice's theorem.
You share your screen, we go through your latest exercise and exam scope. We see where you really stand, not where you think you do.
We construct DFAs and NFAs, convert with the subset construction and practise regular expressions, on your actual exam material.
The proof blocks. Apply the pumping lemma cleanly, build context-free grammars and argue undecidability by reduction. Step by step.
You solve your university's mock exam against the clock. We review every task: what is solid, where you get stuck and which task types are likely to come up.
I built Study IT because I have seen first-hand how IT teaching at university falls apart.
The people who teach here know code from real projects. Practice decides, not the diploma.
Reach me directly: marcel.schmidtpeter@study-it.education
B.Sc. in Computer Science with the core modules others dread: automata, formal languages, computability and complexity. He makes abstract proofs tangible and drills the constructions that count in the exam.
„Mein Ziel ist, dass du Sicherheit im Umgang mit Code gewinnst und Zusammenhänge wirklich verstehst, statt fertige Lösungen zu übernehmen."
If theoretical computer science is not your bottleneck, one of these pages probably fits better.
Free intro call, 30 minutes. We look at your material and tell you honestly how many sessions you need.
