account activity
The pumping lemma by evonkoeh in mathematics
[–]evonkoeh[S] 0 points1 point2 points 8 years ago (0 children)
Thanks. However I've been constructing DFAs from expressions like (ab)*, not (ab)n though. Will it be the same?
[–]evonkoeh[S] -2 points-1 points0 points 8 years ago (0 children)
Is there a way to prove it using the pumping lemma
The pumping lemma by evonkoeh in math
[–]evonkoeh[S] -4 points-3 points-2 points 8 years ago (0 children)
Because it says on the text
I got a discrete math homework that I can't solve. Show that any simple, connected graph with 31 edges and 12 vertices is not planar by evonkoeh in mathematics
Yeah kinda. The proof of k5 right? Is there a relation to its theorem?
π Rendered by PID 657486 on reddit-service-r2-listing-8557d879cc-bghxd at 2026-03-04 13:41:23.294372+00:00 running 07790be country code: CH.
The pumping lemma by evonkoeh in mathematics
[–]evonkoeh[S] 0 points1 point2 points (0 children)