2021-11-08 01:04:53 +01:00
|
|
|
Read a description of a non-deterministic finite-state automaton in the AT&T format
|
|
|
|
|
(without weights) from the file in the first argument.
|
|
|
|
|
|
|
|
|
|
Read strings from the standard input.
|
|
|
|
|
If a string is accepted by the
|
|
|
|
|
automaton, write YES, otherwise- write NO.
|
|
|
|
|
|
|
|
|
|
The program is invoked like this: python run.py test1.arg < test1.in > test1.out
|
|
|
|
|
|
|
|
|
|
Note that not all transitions must be included in description.
|
|
|
|
|
If no transition is given for the given state and letter, write NO.
|
|
|
|
|
|
|
|
|
|
POINTS: 3
|
2021-11-08 07:55:42 +01:00
|
|
|
DEADLINE: 2021-11-20 23:59:59
|
