GATE CSE 2021 Set 2 | Finite Automata and Regular Language Question 13 | Theory of Computation

PREVIOUS NEXT

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 15 English

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

Your input ____

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1’s?

10*(0*10*10*)*

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

(0*10*10*)*10*

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

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

Consider the following statements.

I. If L₁ $$ \cup $$ L₂ is regular, then both L₁ and L₂ must be regular.

II. The class of regular languages is closed under infinite union.

Which of the above statements is/are TRUE?

I only

II only

Both I and II

Neither I nor II

GATE CSE 2019

MCQ (Single Correct Answer)

-0.33

If L is a regular language over Σ = {a,b}, which one of the following languages is NOT regular?

Suffix (L) = {y ∈ Σ* such that xy ∈ L}

{ww^R │w ∈ L}

Prefix (L) = {x ∈ Σ*│∃y ∈ Σ* such that xy ∈ L}

L ∙ L^R = {xy │ x ∈ L, y^R ∈ L}

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

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