non-deterministic finite automata being relatable

lemmy.ml

non-deterministic finite automata being relatable

lemmy.ml

Napain@lemmy.ml to

Programmer Humor@lemmy.ml · 1 year ago

its ok, NFA

You must log in or register to comment.

Chat

Programmer Humor@lemmy.ml

programmerhumor@lemmy.ml

Create a post

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.

311 users / day
2.93K users / week
4.6K users / month
15K users / 6 months
1 local subscriber
32.4K subscribers
1.36K Posts
26.8K Comments
Modlog