mirror of
https://github.com/duszekjk/jezykiformalne.git
synced 2024-11-23 23:55:28 +01:00
11 lines
369 B
Plaintext
11 lines
369 B
Plaintext
|
Use a deterministic finite-state automaton (FSA) engine from the previous task.
|
||
|
|
Create your own FSA description to check whether the word "ophelia" is in the given line.
|
||
|
|
Save it to fsa_description.arg file.
|
||
|
|
|
||
|
|
FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
|
||
|
|
|
||
|
|
Read strings from the standard input.
|
||
|
|
If a string is accepted by the
|
||
|
|
automaton, write YES, otherwise- write NO.
|
||
|
|
|