Programmer Humor · 1 year ago

non-deterministic finite automata being relatable

5

26

non-deterministic finite automata being relatable

Programmer Humor · 1 year ago

5

its ok, NFA

Chat

NapainOP
link
fedilink
arrow-up
2·
1 year ago
“This problem is log-space-reducible to the reachability problem.” xD

Programmer Humor

programmerhumor

You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !programmerhumor@lemmy.ml

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.

Visibility: Public

This community can be federated to other instances and be posted/commented in by their users.

391 users / day
1.51K users / week
4K users / month
12.9K users / 6 months
5.61K local subscribers
32.8K subscribers
1.75K Posts
37.4K Comments
Modlog