1
GATE CSE 2025 Set 1
MCQ (More than One Correct Answer)
+2
-0

Consider the following deterministic finite automaton (DFA) defined over the alphabet, $\Sigma=\{a, b\}$. Identify which of the following language(s) is/are accepted by the given DFA.

GATE CSE 2025 Set 1 Theory of Computation - Finite Automata and Regular Language Question 3 English

A
The set of all strings containing an even number of $b$ 's.
B
  The set of all strings containing the pattern bab.
C
The set of all strings ending with the pattern bab.
D
The set of all strings not containing the pattern aba.
2
GATE CSE 2025 Set 1
Numerical
+2
-0

Consider a finite state machine (FSM) with one input $X$ and one output $f$, represented by the given state transition table. The minimum number of states required to realize this FSM is ________ . (Answer in integer)

Present state Next state Output $f$
$X = 0$ $X = 1$ $X = 0$ $X = 1$
A F B 0 0
B D C 0 0
C F E 0 0
D G A 1 0
E D C 0 0
F F B 1 1
G G H 0 1
H G A 1 0

Your input ____
3
GATE CSE 2024 Set 2
MCQ (Single Correct Answer)
+2
-0.66

Let M be the 5-state NFA with ε-transitions shown in the diagram below.

GATE CSE 2024 Set 2 Theory of Computation - Finite Automata and Regular Language Question 9 English

Which one of the following regular expressions represents the language accepted by M?

A

(00)* + 1(11)*

B

0* + (1 + 0(00)*)(11)*

C

(00)* + (1 + (00)*)(11)*

D

0+ + 1(11)* + 0(11)*

4
GATE CSE 2024 Set 2
Numerical
+2
-0

Let L1 be the language represented by the regular expression b*ab*(ab*ab*)* and L2 = { w ∈ (a + b)* | |w| ≤ 4 }, where |w| denotes the length of string w. The number of strings in L2 which are also in L1 is __________.

Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP