The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > The Finite state machine described by the fol...

Join the Discussion on the App

The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit output

a)
Outputs the sum of the present and the previous bits of the input.
b)
Outputs 01 whenever the input sequence contains 11.
c)
Outputs 00 whenever the input sequence contains 10.
d)
None of these

Correct answer is option 'A'. Can you explain this answer?

FREE This question is part of

Test: Moore Machine

Attempt Test

Attempt this Test

Verified Answer

The Finite state machine described by the following state diagram with...

We assume the input string to be 1101.

1. (A, 1) –> (B, 01)
Here, previous input bit + present input bit = 0 + 1 = 01 = output

2. (B, 1) –> (C, 10)
Here, previous input bit + present input bit = 1 + 1 = 10 = output

3. (C, 0) –> (A, 01)
Here, previous input bit + present input bit = 1 + 0 = 01 = output

4. (A, 1) –> (B, 01)
Here, previous input bit + present input bit = 0 + 1 = 01 = output

Thus, option (A) is correct.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit output

View answer

You are given two stacks with the element 1,2,3,4,5, which must be placed in the same sequence in both stacks. Once an element is added to a stack, it can only be popped and displayed (but it cannot be pushed onto the other stack again). So the possible actions are s.pop(), s.push(), and s.top() (to return the stacks top element), and the method display(int) outputs an integer result. Both stacks have access to these three operations. If it is not empty, you can do a pop operation whenever you want. Which of the following sequences cannot be produced with the aforementioned constraints?

View answer

You are given two stacks with the element 1,2,3,4,5, which must be placed in the same sequence in both stacks. Once an element is added to a stack, it can only be popped and displayed (but it cannot be pushed onto the other stack again). So the possible actions are s.pop(), s.push(), and s.top() (to return the stacks top element), and the method display(int) outputs an integer result. Both stacks have access to these three operations. If it is not empty, you can do a pop operation whenever you want. Which of the following sequences cannot be produced with the aforementioned constraints?

View answer

A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences X[m] and Y[n] of lengths m and n respectively, with indexes of X and Y starting from 0. We wish to find the length of the longest common sub-sequence(LCS) of X[m] and Y[n] as l(m,n), where an incomplete recursive definition for the function l(i,j) to compute the length of The LCS of X[m] and Y[n] is given below:l(i,j) = 0, if either i=0 or j=0 = expr1, if i,j 0 and X[i-1] = Y[j-1] = expr2, if i,j 0 and X[i-1] != Y[j-1]

View answer

A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences X[m] and Y[n] of lengths m and n respectively, with indexes of X and Y starting from 0. We wish to find the length of the longest common sub-sequence(LCS) of X[m] and Y[n] as l(m,n), where an incomplete recursive definition for the function l(i,j) to compute the length of The LCS of X[m] and Y[n] is given below:l(i,j) = 0, if either i=0 or j=0= expr1, if i,j > 0 and X[i-1] = Y[j-1]= expr2, if i,j > 0 and X[i-1] != Y[j-1]

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer?.

Solutions for The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit outputa)Outputs the sum of the present and the previous bits of the input.b)Outputs 01 whenever the input sequence contains 11.c)Outputs 00 whenever the input sequence contains 10.d)None of theseCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam