GATE CSE 2025 Set 1 | Finite Automata and Regular Language Question 1 | Theory of Computation

GATE CSE 2025 Set 1

MCQ (Single Correct Answer)

-0

A regular language $L$ is accepted by a non-deterministic finite automaton (NFA) with $n$ states. Which of the following statement(s) is/are FALSE?

$L$ may have an accepting NFA with $< n$ states.

$L$ may have an accepting DFA with $< n$ states.

There exists a DFA with $\leq 2^n$ states that accepts $L$.

Every DFA that accepts $L$ has $>2^n$ states.

GATE CSE 2024 Set 2

MCQ (Single Correct Answer)

-0.33

Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?

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

0*1(0 + 10*1)*

0*(10*11)*0*

0*1(010*1)*0*

0(1 + 0*10*1)*0*

GATE CSE 2024 Set 1

MCQ (More than One Correct Answer)

-0

Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular. Which of the following statements is/are always TRUE?

$L_1 = L_2$ if and only if $L_1 \cap \overline{L_2} = \emptyset$

$L_1 \cup L_3$ is not regular

$\overline{L_3}$ is not regular

$L_1 \cup \overline{L_2}$ is regular

GATE CSE 2023

MCQ (Single Correct Answer)

-0.33

Consider the Deterministic Finite-state Automation (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 the start state and $$p$$ being the only final state.

GATE CSE 2023 Theory of Computation - Finite Automata and Regular Language Question 15 English

Which one of the following regular expressions correctly describes the language accepted by $$A$$?

$$1(0^*11)^*$$

$$0(0+1)^*$$

$$1(0+11)^*$$

$$1(110^*)^*$$

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory