GATE CSE 2023 | Finite Automata and Regular Language Question 9 | Theory of Computation

PREVIOUS NEXT

GATE CSE 2023

MCQ (More than One Correct Answer)

-0

Which of the following statements is/are CORRECT?

The intersection of two regular languages is regular.

The intersection of two context-free languages is context-free.

The intersection of two recursive languages is recursive.

The intersection of two recursively enumerable languages is recursively enumerable.

GATE CSE 2022

MCQ (Single Correct Answer)

-0.33

Which one of the following regular expressions correctly represents the language of the finite automation given below?

GATE CSE 2022 Theory of Computation - Finite Automata and Regular Language Question 12 English

ab*bab* + ba*aba*

(ab*b)* ab* + (ba*a)*ba*

(ab*b + ba*a)* (a* + b*)

(ba*a + ab*b)* (ab* + ba*)

GATE CSE 2021 Set 2

MCQ (Single Correct Answer)

-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?

{0,1}* - L

L.L

L - {01}

L ∪ {01}

GATE CSE 2021 Set 2

Numerical

-0

Consider the following deterministic finite automaton (DFA).

GATE CSE 2021 Set 2 Theory of Computation - Finite Automata and Regular Language Question 16 English

The number of strings of length 8 accepted by the above automaton is __________

Your input ____

PREVIOUS NEXT

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 Deadlocks Memory Management File System IO and Protection

Algorithms

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

Digital Logic

K Maps Boolean Algebra 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

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

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

Programming Languages

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

Computer Organization

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