14 lines
373 B
Plaintext
14 lines
373 B
Plaintext
![]() |
Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
|
||
|
Create your own non deterministic FSA description to check whether the string
|
||
|
contains "abc"
|
||
|
|
||
|
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: 2022-01-30 16:00:00
|
||
|
REMAINDER: 2/3
|