mirror of
https://github.com/duszekjk/jezykiformalne.git
synced 2024-11-30 09:25:27 +01:00
12 lines
423 B
Plaintext
12 lines
423 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 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.
|
||
|
|
|