djfz-2020-s444399/TaskF02/description.txt
Jakub Pokrywka 07ff04b479 add F block
2020-12-21 09:48:35 +01:00

15 lines
462 B
Plaintext

Use a non deterministic finite-state automaton (FSA) engine from the TaskF00.
Create your own non deterministic FSA description to check whether the string
ends with "ab"
Don't use external files like in TaskF00 (description should be included in run file).
The alphabet is "a", "b", "C"
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 4
DEADLINE: 2021-01-04 23:59:59
REMAINDER: 1/3