COMP30026_2025_SM2 Worksheet 8

L = {(01)n(10)m | n ≥ 0, m ≥ 2} is a regular language. Select the errors that are present in the following fooling set ‘proof’ that L is not regular: Proof (attempt): Suppose there is a DFA with k st...