GATE CSE 2002 | Recursively Enumerable Language and Turing Machine Question 27 | Theory of Computation

PREVIOUS NEXT

GATE CSE 2002

MCQ (Single Correct Answer)

-0.6

The $$C$$ language is:

A context free language

A context sensitive language

A regular language

Parsable fully only by a Turing machine

GATE CSE 1997

MCQ (Single Correct Answer)

-0.6

Which one of the following is not decidable?

Given a Turing machine $$M,$$ a stings s and an integer $$k,$$ $$M$$ accepts $$s$$ within $$k$$ steps

Equivalence of two given Turing machines

Language accepted by a given finite state machine is not empty

Language generated by a context free grammar is non empty

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

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

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

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

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

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