Feature Request: It would be cool if a page like https://bbchallenge.org/1LC0LA---0LC0RD1LA1LB1RE1RD0RE linked to the “standard” TNF version: https://bbchallenge.org/3810716 somehow.
I really like this feature. I basically had to do code for that in Python in order to give the translations of Skelet’s machines as indices of our DB (https://bbchallenge.org/skelet).
Although there is the tiny tiny inconvenient that I believe TNF is not computable in general
However, it should be OK for 5-state machines.
Yes, TNF is not (generally) computable But for n-state machines you just need to run TNF algorithm for BB(n-1) steps which is quite tractable for 5-state case
Alternatively, you could consider Nick Drozd’s “Lexical Normal Form”
Cool, definitely going to look into that!