2019-11-04 21:34:38 +01:00
|
|
|
Deterministic automaton II
|
|
|
|
|
==========================
|
|
|
|
|
|
|
|
|
|
Read a description of a finite-state automaton in the AT&T format
|
|
|
|
|
(without weights) from the standard input. Then, read strings from the
|
|
|
|
|
file whose name was given as the first argument. If a string is
|
|
|
|
|
accepted by the automated, write YES, a space and the string on the
|
|
|
|
|
standard output, otherwise — write NO, a space and the string.
|
|
|
|
|
|
|
|
|
|
If there is a non-determinism in the automaton, the first transition should be chosen.
|
|
|
|
|
|
|
|
|
|
Your program does not have to check whether the description is
|
|
|
|
|
correct. You can assume that the automaton does not contain epsilon transitions.
|
|
|
|
|
|
|
|
|
|
NOTE: Task only for students whose student index number ("numer
|
|
|
|
|
indeksu") is divisable by 3 with a remainder of 1
|
|
|
|
|
|
|
|
|
|
POINTS: 8
|
2019-11-05 14:32:03 +01:00
|
|
|
DEADLINE: 2019-11-25 23:59
|
2019-11-04 21:34:38 +01:00
|
|
|
REMAINDER: 1/3
|
