GATE CSE 2003 | Recursively Enumerable Language and Turing Machine Question 23 | Theory of Computation

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

If the strings of a language $$L$$ can be effectively enumerated in lexicographic (i.e., alphabetic$$(c)$$ order, which of the following statements is true?

$$L$$ is necessarily finite

$$L$$ is regular but not necessarily finite

$$L$$ is context free but not necessarily regular

$$L$$ is recursive but not necessarily context free

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?

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

TRUE

FALSE

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 P and NP Concepts Dynamic Programming

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

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

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

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra 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