2021-12-08 16:04:20 +01:00
|
|
|
Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
|
|
|
|
|
Create your own FSA description to check whether the string contains "0"
|
|
|
|
|
even number of times.
|
|
|
|
|
Save it to test.arg file.
|
|
|
|
|
|
|
|
|
|
The alphabet is "0", "1".
|
|
|
|
|
|
|
|
|
|
Read strings from the standard input.
|
|
|
|
|
If a string is accepted by the
|
|
|
|
|
automaton, write YES, otherwise- write NO.
|
|
|
|
|
|
|
|
|
|
POINTS: 3
|
2021-12-09 17:52:12 +01:00
|
|
|
DEADLINE: 2021-01-01 23:59:00
|
2021-12-08 16:04:20 +01:00
|
|
|
REMAINDER: 3/4
|
