djfz-2020/TaskF01/description.txt

15 lines
480 B
Plaintext
Raw Normal View History

2020-12-21 09:48:35 +01:00
Use a non deterministic finite-state automaton (FSA) engine from the TaskF00.
Create your own non deterministic FSA description to check whether the string second letter
from right is 'b'.
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: 0/3