hello, I am having some trouble with the pumping lemma for regular languages, specifically for proving that the language $w \in \{a, b\}^∗ : w^R \neq w$ is not regular
specifically, how can one prove that is it not regular, without setting restrictions on |y|? I find myself unable to pick any fitting words that would prove this
nevermind
I got it
proves that sleeping on it works like a charm¸ I've been stuck on this since last night!
Anyone wants to explain me exactly why would this version be more efficient than this, where the context is the implementation of a while loop in an arbitrary IR (intermediate representation language)?
Apparently, the first version generally performs slightly better because it is often better predicted by the processor's branch prediction unit (which is designed to prevent stalls in the processor), but how exactly is that one "better predicted by the processor's branch prediction unit"?
Moreover, note that in current days' computers both implementations may be equivalent in terms of efficiency, but once that wasn't like that, and I'm interested in knowing the details.
@vzn I have just mended the fences with Java and burried the hatchet with JavaScript. If only I could work things out with the time. No matter how politely I ask it keeps running too fast.
