GATE CSE 1999 | Push Down Automata and Context Free Language Question 45 | Theory of Computation

PREVIOUS NEXT

GATE CSE 1999

MCQ (More than One Correct Answer)

-0.6

If $${L_1}$$ is a context free language and $${L_2}$$ is a regular which of the following is/are false?

$${L_1} - {L_2}$$ is not context free

$${L_1} \cap {L_2}$$ is context free

$$ \sim {L_1}$$ is context free

$$ \sim {L_2}$$ is regular

GATE CSE 1998

MCQ (Single Correct Answer)

-0.6

Let $$L$$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite-state automation accepting $$L$$ is

$$2$$

$$5$$

$$8$$

$$3$$

GATE CSE 1998

MCQ (Single Correct Answer)

-0.6

Which of the following statements is false?

Every finite subset of a non-regular set is regular

Every subset of a regular set is regular

Every finite subset of a regular set is regular

The intersection of two regular sets is regular

GATE CSE 1997

MCQ (Single Correct Answer)

-0.6

Which of the following languages over $$\left\{ {a,b,c} \right\}$$ is accepted by Deterministic push down automata?

$$\left\{ {w \subset {w^R}\left| {w \in \left\{ {a,b} \right\}{}^ * } \right.} \right\}$$

$$\left\{ {w{w^R}\left| {w \in \left\{ {a,b,c} \right\}{}^ * } \right.} \right\}$$

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

$$\left\{ {w\left| w \right.} \right.$$ is palindrome over $$\left. {\left\{ {a,b,c} \right\}} \right\}$$

PREVIOUS NEXT

GATE CSE Subjects

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

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 Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

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 Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory