ALL GATE QUESTIONS SUBJECTWISE
×

Regular Language and Finite Automata

1 Mark Questions 2 Marks Questions 5 Marks Questions

Context Free Language and Pushdown Automata

1 Mark Questions 2 Marks Questions 5 Marks Questions

Contextsensitive Language And Turing Machine

1 Mark Questions 2 Marks Questions 5 Marks Questions

Undecidability

1 Mark Questions 2 Marks Questions




GATE 1987 Question - Marks 5

Give minimal DFA that performs as a Mod-3 1’s counter, i.e., outputs a 1 each time the number of 1’s in the input sequence is a sequence is a multiple of 3.


Total 4 Questions



Share: