Non-deterministic Turing Machine representation

[anioncat]

Proposed feature or solution

Currently only one scenario of the tape is represented during the testing simulation. The trace on the graph found in the FSA and PDAs is missing.

Alternatives

Our supervisor also expressed interest in all states of a Turing machine to be simulated, with the user being able to switch from testing for acceptance and tracing the tape/graph step-by-step. This may require a rewrite of the simulation code for yielding each expansion, rather than doing a pre-search.

Additional information

No response

[tdib]

This was something that was discussed a long time ago, and it was decided that we wouldn't really want/need something like this - reason being that almost every time you simulate automata you don't really need every outcome, and the complexity of the UI would be more complex and the whole idea is to keep it nice for the user. I believe the stepping lab does do something like this but it's not very clear.

While it can be a nice feature at times, I think it makes things tremendously clunky (like with JFLAP) and makes it confusing overall with so many paths. If you do decide on this functionality, I would recommend keeping it separate/optional for the user since most of the time you are just testing for acceptance.