/sci/ - Science & Math

>>14860168
you have to understand how the pumping lemma creates a 'lineage' (not really, it's a directed acyclic graph) of rejected strings where the 'parent' of a rejected string a x^{n+1} b is a x^n b where a,x, and b satisfy the premises of the pumping lemma...essentially once you transition into the state obtained by reading 'a' you then go in circles by reading 'x' an arbitrary number of times until transitioning to reject state obtained by reading 'b'
I think there's an episode from pic related on this topic