edited by
2,016 views
1 votes
1 votes

Consider an output-producing, deterministic finite state automaton (DFA) of the kind indicated in the figure below, in which it is assumed that every state is a final state. 

Assume that the input is at least four bits long. Which of the following is(are) true?

I. The last bit of the output depends on the start state.

II. If the input ends with "1100", then the output must end with "1".

III. The output cannot end with "1" unless the input ends with "1100".

(A) I only

(B) II only

(C) I and II only

(D) II and III only

edited by

1 Answer

1 votes
1 votes

Answer (D) here

It is a Mealy machine.

First one is input here. and second one output.

It can take several inputs like 001100,111100,...............

But at last it must accept 1100 as input to get 1 as output.

And at last output 1 means the state is accepted , otherwise 0 means it will be rejected state

Related questions

1 votes
1 votes
1 answer
3
sh!va asked Jul 9, 2016
2,418 views
main () { struct xx { int x = 3; char name[] = "hello"; }; struct xx *s; printf("%d", s->x); printf("%s", s->name); }The output is :3hello104ello104helloCompiler error
0 votes
0 votes
0 answers
4
pC asked Sep 7, 2018
580 views
#include <stdio.h>int main(void) { int i=10; printf(" %d %d %d",i==10,i=40,i>15 );} Conceptsundefined behaviorfloating point representation