From Hopcroft's Introduction to Automata Theory, Languages, and Computations, 3ed, chapter 5 p. 172:
I don't quite get how can there be fewer 0's in the left of 1 if we have w = 0^n*1*0^n?
From Hopcroft's Introduction to Automata Theory, Languages, and Computations, 3ed, chapter 5 p. 172:
I don't quite get how can there be fewer 0's in the left of 1 if we have w = 0^n*1*0^n?
Copyright © 2021 JogjaFile Inc.
