GATE CSE 2021 Set 2 | Push Down Automata and Context Free Language Question 13 | Theory of Computation

PREVIOUS NEXT

GATE CSE 2021 Set 2

MCQ (More than One Correct Answer)

-0

Let L₁ be a regular language and L₂ be a context-free language. Which of the following languages is/are context-free?

L₁ ∩ L̅₂

L₁ ∪ (L₂ ∪ L̅₂)

$$\overline {{{\bar L}_1} \cup {{\bar L}_2}} $$

(L₁∩ L₂) ∪ (L̅₁ ∩ L₂)

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

-0.33

Suppose that L₁ is a regular and L₂ is a context-free language, Which one of the following languages is NOT necessarily context-free?

L₁ ⋅ L₂

L₁ ∪ L₂

L₁ ∩ L₂

L₁ - L₂

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

-0

Let $$\left\langle M \right\rangle $$ denote an encoding of an automation M. Suppose that ∑ = {0, 1}. Which of the following languages is/are NOT recursive?

L = { $$\left\langle M \right\rangle $$ | M is a PDA such that L(M) = ∑*}

L = { $$\left\langle M \right\rangle $$ | M is a DFA such that L(M) = Φ}

L = { $$\left\langle M \right\rangle $$ | M is a PDA such that L(M) = Φ}

L = { $$\left\langle M \right\rangle $$ | M is a DFA such that L(M) = ∑*}

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-0.3

Which of the following languages is generated by the given grammar? $$$S \to aS|bS|\varepsilon $$$

$$\left\{ {{a^n}{b^m}|n,m \ge 0} \right\}$$

$$\left\{ {w \in \left\{ {a,b} \right\}{}^ * |w} \right.$$ has equal number of $$a’s$$ and $$\left. {b's} \right\}$$

$$\left\{ {{a^n}|n \ge 0} \right\} \cup \left\{ {{b^n}|n \ge 0} \right\} \cup \left\{ {{a^n}{b^n}|n \ge 0} \right\}$$

$${\left\{ {a,b} \right\}^ * }$$

PREVIOUS NEXT

GATE CSE Subjects

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

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

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

Basic of Programming Language Function and Recursion 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