The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+18 votes

Given the following state table of an FSM with two states $A$ and $B$,one input and one output.

PRESENT STATE $A$ |
PRESENT STATE $B$ |
Input |
Next State $A$ |
Next State $B$ |
Output |

$0$ | $0$ | $0$ | $0$ | $0$ | $1$ |

$0$ | $1$ | $0$ | $1$ | $0$ | $0$ |

$1$ | $0$ | $0$ | $0$ | $1$ | $0$ |

$1$ | $1$ | $0$ | $1$ | $0$ | $0$ |

$0$ | $0$ | $1$ | $0$ | $1$ | $0$ |

$0$ | $1$ | $1$ | $0$ | $0$ | $1$ |

$1$ | $0$ | $1$ | $0$ | $1$ | $1$ |

$1$ | $1$ | $1$ | $0$ | $0$ | $1$ |

If the initial state is $A=0 ,B=0$ what is the minimum length of an input string which will take the machine to the state $A=0,B=1$ with $output=1$.

- $3$
- $4$
- $5$
- $6$

+28 votes

Best answer

From above table, we look at next state part

Whenever we reach state $00$ we get output $1$ [at row $1$,row $6$, row $8$], **so we have state 00 with output 1 **

When we reach at state $01$, we get output $0$ [at row $3$, row $5$] and output $1$ [row $7$], **so we have two state 01 with output 0, 01 with output 1.**

When we reach at state $10$, we get output we get output $0$ [at row $2$, row $4$], **so we have state 10 with output 0.**

We don't reach at state $11$ [$11$ is not there in next state part], but **we have state 11 with don't know (N) output.**

If we draw the Moore Machine for above **FSM** [ from the table: present state x input symbol -> next state ]

It is clear from **FSM** from state $00$ to reach state $01$ with output $1$ i.e, $01/1$ with need **minimum length input 101 **

Mminimum length of input $=$ length of $101$. **That is 3.**

+16 votes

A = 0, B = 1, Output = 1 is given only by the second last transition in the table. So, we can go back from here.

Here, the previous state is A = 1, B = 0. So, see which state gives next state as this. (1 char is gone here)

The second and fourth transitions in the table gives this as next state. Previous state of second transition is A = 0 and B = 1. Lets consider this first (2 chars gone).

The fifth transition gives A = 0 and B = 1 from A = 0, B = 0 which is our given initial state (3 chars). So, we needn't check any other possibility as 3 must be the minimum length of the input string.

Here, the previous state is A = 1, B = 0. So, see which state gives next state as this. (1 char is gone here)

The second and fourth transitions in the table gives this as next state. Previous state of second transition is A = 0 and B = 1. Lets consider this first (2 chars gone).

The fifth transition gives A = 0 and B = 1 from A = 0, B = 0 which is our given initial state (3 chars). So, we needn't check any other possibility as 3 must be the minimum length of the input string.

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.4k
- Digital Logic 2.1k
- Programming & DS 4k
- Algorithms 3.4k
- Theory of Computation 4.2k
- Compiler Design 1.6k
- Databases 3.1k
- CO & Architecture 2.7k
- Computer Networks 3.1k
- Non GATE 1.1k
- Others 1.4k
- Admissions 501
- Exam Queries 449
- Tier 1 Placement Questions 19
- Job Queries 62
- Projects 12

38,058 questions

45,554 answers

131,900 comments

48,919 users