Thompson Construction Method
Thompson construction method is used in constructing the 𝟄-Non Deterministic Finite Automata (𝟄-NFA) from regular expression
Also called McNaughton–Yamada–Thompson algorithm
This algorithm recursively splits the regular expression into subexpressions and the NFA is constructed from it using certain rules.
Rules defining the NFA
Construct NFA for 01* using Thompson Construction Method
Construct NFA for (1*00)* using Thompson Construction Method