djfz-2020-s444399/TaskE01/description.txt

15 lines
590 B
Plaintext
Raw Normal View History

2020-12-06 17:47:39 +01:00
Use a deterministic finite-state automaton (FSA) engine from the previous task.
Create your own FSA description to check whether the word "Hamlet" is in the given line.
Don't use external files like in TaskE00 (description should be included in run file).
2020-12-24 09:36:56 +01:00
You may restrict the FSA alphabet to characters included in the word "Hamlet" plus "x" and
2020-12-06 17:47:39 +01:00
change all characters different from characters in word "Hamlet" to "x".
Read strings from the standard input.
2020-12-24 09:36:56 +01:00
If a string is accepted by the
automaton, write YES, otherwise- write NO.
2020-12-06 17:47:39 +01:00
POINTS: 2
2020-12-24 09:36:56 +01:00
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 0/4