GATE CSE 1994 | Recursively Enumerable Language and Turing Machine Question 28 | Theory of Computation

GATE CSE 1994

MCQ (Single Correct Answer)

-0.6

Which of the following conversions is not possible (algorithmically)?

Regular grammar to context free grammar

Non-deterministic $$FSA$$ to deterministic $$FSA$$

Non-deterministic $$PDA$$ to deterministic $$PDA$$

Non-deterministic Turing machine to deterministic Turing machine

GATE CSE 1992

MCQ (More than One Correct Answer)

-0.6

In which of the cases stated below is the following statement true?
“For every non-deterministic machine $${M_1}$$ there exists an equivalent deterministic machine $${M_2}$$ recognizing the same language“.

$${M_1}$$ is nondeterministic finite automation

$${M_1}$$ is a nondeterministic $$PDA$$

$${M_1}$$ is a non-deterministic Turing machine

For no machine $${M_1}$$ use the above statement true

GATE CSE 1990

MCQ (Single Correct Answer)

-0.6

Recursive languages are:

A proper superset of context free languages.

Always recognizable by pushdown automata.

Also called Type $$(0)$$ languages.

Recognizable by Turing machines.

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

Algorithms

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

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

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

Verbal Ability Numerical 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