Question

Prove that the following language is not regular L3 = { w | w is a binary string of the form 0^n10^n , where n≥1}

Answer 1

Answer:

l b h v -b*2 the hope it's clear thanks