Hello, dear friend, you can consult us at any time if you have any questions, add WeChat:Yooo932851

ubmission is through give and should consist of:

1. A single pdf file with typeset answers, maximum size 4Mb. Prose should be typed, not handwritten.
Use of LATEX is strongly encouraged, but not required.
2. A file partner.txt with a single line on the format. z<digits> . This must be the zID of your
group partner. For individual submissions, write your own zID.
Submit your work using the web interface linked on the course website, or by running the following on a
CSE machine
give cs2111 assn2 assn2.pdf partner.txt
This assignment is to be done in pairs. Individual submissions are discouraged, but will be accepted. Only
one member of the pair should submit. Work out who will submit ahead of time—duplicate submissions
are extremely annoying to sort out.
Late submission is allowed up to 5 days (120 hours) after the deadline. A late penalty of 5% per day will
be deducted from your total mark.
Discussion of assignment material with others is permitted, but you may not exchange or view each
others’ (partial) solutions. The work submitted must be your own, in line with the University’s plagiarism
policy. Note in particular that attempting to pass off AI writing (e.g. ChatGPT output) as your own still
counts as plagiarism.
Background In the lectures, we defined the set of traces (aka runs) for unlabelled transition systems. For

example, if we ignore the labels on this transition system:

the set of traces starting from q0, which we will write Tr(q0), is the following:
{q0, q0q1, q0q1q2, q0q1q3, q0q1q3q4}
But the set of maximal traces, which we will write MTr(q0), is
{q0q1q2, q0q1q3q4}