GATE CSE 2025 Set 1 | Finite Automata and Regular Language Question 7 | 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 14 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 21 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^*)^*$$

PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation

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

Operating Systems

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

Algorithms

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

Digital Logic

Boolean Algebra K Maps Combinational Circuits Number Systems Sequential Circuits

Database Management System

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

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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