Why am I laughing? I don’t know any of these languages?

It’s been a while, so I’m quite rusty, especiallyeon the terminology, but I think we modelled feasible sequences of finite and infinite state machines using regexes.

That’s how I was forced to learn 'em in uni. ;)

Regexes are actually used in formal computer science (if that’s the right term), i.e. “proof that this and that algorithm won’t deadlock” or something like that.

They’re actually really elegant and can cover a lot. But you’ll have to learn them by using them.

Here’rs the project page

Here’s the sourge code repo

Louis Rossman is usually legit, but I definetly understand your wearyness. OP should do better.

They do link to the sourde code and the website in the video description.

The lemmy post could be better, though.