Hi everyone,
I have explained in today's class how to represent an
automaton in a text file. Here I give a complete example
that you can follow.
------ file begins ------
states: q1, q2, q3, q4;
alphabet: a, b, c, d;
transitions:
(q1, a, q1), (q1, b, q2), (q1, d, q3), (q2, a, q1), (q3, b, q1),
(q4, d, q1), (q4, d, q2), (q3, c, q2);
start: q4;
accepts: q1, q2;
------ file ends ------
(1) Notice that each part ends with a semicolon ";".
(2) The five components of an automaton must be given following
the order in the above example.
(3) However, space in the file does not matter.
If you are asked in your homework to construct an automaton, you need
to produce a file using the above format to represent the automaton so
that my program can automatically check your file. This is *very*
important for you to receive proper homework credit.
--Hongwei
(This is a message for the class 20-ECES-670-2)