12:51 PM
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
1:56 PM
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)?
2:54 PM
« first day (1901 days earlier) ← previous day next day → last day (2540 days later) »