I'm trying to create a small program that interprets a NFA to the corresponding regex using Thompson's algorithm.My question: What kind of notation can be used to express a NFA (e.g. in the form of a string?) that can be read and then interpreted by the program?
Programming Thompson's algorithm: How to represent a NFA?
automata;finite automata;syntax