Write the formal description of the following state machine (M) What is the language recognized by M;L(M)?
Solution
the language that is accepted is: 0 * 10 * 10 *
explanation:
start node contains the self loop with value \'0\' i.e it may iterate as many times as it needed zero or more number of times
* represents zero or more number of times
\' s 0 \' \': it must pass through \'1\' no other choice
it reaches s 1
when it is on s 1 it has self loop with \'0\'
so it will iterate zero or more number of times i.e 0 *
\' s 1 \' \': it must pass through \'1\' no other choice
it reaches s 2
when it is on s2 it has self loop with \'0\'
so it will iterate zero or more number of times i.e 0 *
s 2 is the end state
so we cannot go from here an further
.
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Write the formal description of the following state machine (M) What.docx
1. Write the formal description of the following state machine (M) What is the language recognized
by M;L(M)?
Solution
the language that is accepted is: 0 * 10 * 10 *
explanation:
start node contains the self loop with value '0' i.e it may iterate as many times as it needed zero or more number of times
* represents zero or more number of times
' s 0 ' ': it must pass through '1' no other choice
it reaches s 1
when it is on s 1 it has self loop with '0'
so it will iterate zero or more number of times i.e 0
*
' s 1 ' ': it must pass through '1' no other choice
it reaches s 2
when it is on s2 it has self loop with '0'
so it will iterate zero or more number of times i.e 0
*
s 2
is the end state
so we cannot go from here an further
