Computer Sciences > GATE 2026 SET-2 > Theory of Computation
Consider the following two finite automata D₁ and D₂.
Which of the following statements is/are true?
A
L(D₁) = L(D₂)
B
L(D₁) is a proper subset of L(D₂)
C
L(D₁) ∩ L(D₂) = {ε}
D
(L(D₁) ∪ L(D₂))* consists of all strings in {0,1}* whose length is divisible by 3

Correct : a,c

Similar Questions

Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0, 1}, and has the set of states {s,p,q,r}, with s being th...
#952 MCQ
Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: Which one of the fo...
#956 MCQ
Consider the context-free grammar G below: S -> aSb | X X -> aX | Xb | a | b where S and X are non-terminals, and a and b are terminal symbols. The starting non...
#974 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: