6th programming task
You can solve ony a), which gives max 2 points, or a) and b), which gives
max 3points.
a) Implement an finite automaton, which recognizes legal Turing
machine codes according to coding system introduced in the
course. Test your program with different inputs!
b) Enlarge your program so hat it generates legal Turing machine codes
in canonic order. For this purpose add a component, which generates
all binary strings (0,1,00,01,10,11,000,...) and gives them to a)-part
program, which selects only legal ones for output. Print at least 20 codes
from the beginning!