mirror of
https://github.com/duszekjk/jezykiformalne.git
synced 2024-11-23 15:55:26 +01:00
11 lines
348 B
Plaintext
11 lines
348 B
Plaintext
Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
|
|
Create your own FSA description to check whether the string starts with "01" and ends with "01.
|
|
Save it to fsa_description.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.
|
|
|