non-deterministic finite automata being relatable

3 years ago by Napain to c/programmerhumor

its ok, NFA

load all comments
cranberryjam 1 point 3 years ago

I'm having flashbacks to my theory to computation class. So much latex. So many proofs...

path: 0 809506, hotness: undefined, score: 1, children: 0
programmerhumor
programmerhumor

@lemmy.ml

login for more options
43801
1628
1576

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

  • Posts must be relevant to programming, programmers, or computer science.
  • No NSFW content.
  • Jokes must be in good taste. No hate speech, bigotry, etc.

go to feed...