Question: Build a non - deterministic FSM for the following language: {w {a, b}* : w contains at least one instance of aaba, bbb or ababa}.
Build a non - deterministic FSM for the following language:
{w {a, b}* : w contains at least one instance of aaba, bbb or ababa}.
| Input strings (Accepted) | Input strings (Rejected) |
| abbbba, abaabab, bababaa | E, aaaabba, aabbaab |
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
