2019-11-04 21:34:38 +01:00
|
|
|
Deterministic automaton I
|
|
|
|
|
=========================
|
|
|
|
|
|
|
|
|
|
Read a description of a finite-state automaton in the AT&T format
|
|
|
|
|
(without weights) from the standard input. First, check whether the
|
|
|
|
|
automaton is deterministic. If the automaton is not deterministic,
|
|
|
|
|
just write the message "NONDETERMINISTIC" on the standard output.
|
|
|
|
|
|
|
|
|
|
If the automaton is deterministic, 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.
|
|
|
|
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
|
|
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: 0/3
|
