← All practice quizzes🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →
Quiz: DFA Minimisation (Table Filling)
5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass
The table-filling (Myhill–Nerode) method for minimising a DFA, done the way exams expect — round by round on a classic 8-state machine — then simulated in Python, with the shortest string that tells two states apart and a program that checks whether two DFAs accept the same language.
Log in to take the quiz
Free account · see your score, answers and explanations, earn XP