GATE CSE 2002 | Push Down Automata and Context Free Language Question 36 | Theory of Computation

PREVIOUS NEXT

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

The language accepted by a pushdown Automation in which the stack is limited to $$10$$ items is best described as

Context free

Regular

Deterministic Context Free

Recursive

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Which of the following statement is true?

If a language is context free it can always be accepted by deterministic pushdown automation

The union of two context free language is context free

The intersection of two context free languages is context free

The complement of a context free language is context free

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Let $${L_D}$$ be the set of all languages accepted by a $$PDA$$ by final state and $${L_E}$$ the set of all languages accepted by empty stack. Which of the following is true?

$${L_D}\,\, = \,\,{L_E}$$

$${L_D}\,\, \supset \,\,{L_E}$$

$${L_D}\,\, \subset \,\,{L_E}$$

None of the above

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Context free languages are closed under:

Union, intersection

Union, Kleene closure

Intersection, complement

Complement, Kleene Closure

PREVIOUS NEXT

GATE CSE Subjects

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

Theory of Computation

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

Operating Systems

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Computer Organization

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

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

Algorithms

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Verbal Ability