Question No. 43 / Question ID 974094
Marks: 4.00
Let $\mathrm{w}=\mathrm{abbbba}$ be a string that belongs to $\{\mathrm{a}, \mathrm{b}\}^{*}$, and $\mathrm{w}$ is not recognized by any Finite State Machine (FSM).
Given below are two statements:
Statement I: A FSM cannot fix the mid-point of the string.
Statement II: A FSM cannot match the second half of the string with the first half.
In the light of above statements, choose the correct answer from options given below
1. Both Statement I and Statement II are true
2. Both Statement I and Statement II are false
3. Statement I is true but Statement II is false
4. Statement I is false but Statement II is true
1 (Chosen Option)
2
3
4
