do you have any idea of designing a deterministic accepter where the set of all these binary strings contains at any position? The string is: 0100101 So, the ac
Is the following CSG for a^nb^nc^n correct? S->aSbC|abc Cb->bC C->c If not please explain why?
My teacher stated that If L = {0^n 1^n | n > 0 } then the complement was regular. I don't think it is. Is there anyone that can clear this up to me? I thou