GATE CSE concept:finite-automata PYQs & Answers

Home
GATE
Computer Science and Information Technology
Topics
concept:finite-automata

Attempt a question, record the concept and assumptions, then check the available answer. Rework mistakes after revising the relevant concepts. Topic tags can overlap; review the question context.

Questions 1–2 of 2. Imported answers require independent review unless marked reviewed.

Topic practice 2 questionsPage 1 of 1

Consider the following two finite automata

and

Diagram for Computer Science and Information Technology question 47

Which of the following statements is/are true?

Your answerSelect all correct options. You can choose more than one.

is a proper subset of

consists of all strings in

whose length is divisible by 3

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following language.

Which one of the following deterministic finite automata accepts

Your answerChoose one option.

Diagram for Computer Science and Information Technology question 38

Diagram for Computer Science and Information Technology question 38 (figure 2)

Diagram for Computer Science and Information Technology question 38 (figure 3)

Diagram for Computer Science and Information Technology question 38 (figure 4)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE CSE concept:finite-automata PYQs

How to practice concept:finite-automata

Question 47

Question 38