1
GATE CSE 2023
MCQ (Single Correct Answer)
+1
-0.33
Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions:
$$\mathrm{letter\to[A-Za-z]}$$
$$\mathrm{letter\to[0-9]}$$
$$\mathrm{id\to letter(letter\,|\,digit)^*}$$
Which one of the following Non-deterministic Finite-state Automata with $$\varepsilon $$-transmissions accepts the set of valid identifiers? (A double-circle denotes a final state)
A
B
C
D
2
GATE CSE 2023
MCQ (More than One Correct Answer)
+1
-0
Which of the following statements is/are CORRECT?
3
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33
Which one of the following regular expressions correctly represents the language of the finite automation given below?
4
GATE CSE 2021 Set 2
MCQ (Single Correct Answer)
+1
-0.33
Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?
Questions Asked from Marks 1
GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (1) GATE CSE 2023 (3) GATE CSE 2022 (1) GATE CSE 2021 Set 2 (2) GATE CSE 2020 (2) GATE CSE 2019 (2) GATE CSE 2016 Set 2 (2) GATE CSE 2016 Set 1 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2014 Set 3 (1) GATE CSE 2014 Set 2 (1) GATE CSE 2014 Set 1 (2) GATE CSE 2013 (1) GATE CSE 2012 (1) GATE CSE 2010 (1) GATE CSE 2009 (1) GATE CSE 2003 (2) GATE CSE 2001 (2) GATE CSE 2000 (2) GATE CSE 1999 (1) GATE CSE 1998 (4) GATE CSE 1997 (1) GATE CSE 1996 (2) GATE CSE 1994 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization