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

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

Regarding the power of recognition of languages, which of the following statement is false?

The non-deterministic finite-state automata are equivalent to deterministic finite-state automata.

Non-deterministic Push-down automata are equivalent to deterministic Push-down automata.

Non-deterministic Turing machines are equivalent to deterministic Turing machines.

Multi-tape Turing machines are equivalent to Single-tape Turing machines.

GATE CSE 1992

True or False

-0

Which of the following statements is / are true / false?

Regular languages are closed under infinite union.

TRUE

FALSE

GATE CSE 1992

True or False

-0

Which of the following statements is / are true / false?

Union of two recursive languages is recursive

TRUE

FALSE

GATE CSE 1992

True or False

-0

Which of the following statements is / are true / false?

The language $$\left\{ {{0^n}\,\left| {\,n} \right.} \right.$$ is prime$$\left. \, \right\}$$ is not regular

TRUE

FALSE

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

Number Systems Boolean Algebra K Maps Combinational Circuits 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