GATE CSE 1998 | Finite Automata and Regular Language Question 83 | Theory of Computation

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

If the regular set $$A$$ is represented by $$A = {\left( {01 + 1} \right)^ * }$$ and the regular set $$'B'$$ is represented by $$B = \left( {{{\left( {01} \right)}^ * }{1^ * }} \right),$$ which of the following is true?

$$A \subset B$$

$$B \subset A$$

$$A$$ and $$B$$ are incomparable

$$A=B$$

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

Which of the following sets can be recognized by a Deterministic Finite-state Automation?

The numbers $$1, 2, 4, 8, $$ ...... $${2^n},$$ ............. written in binary.

The numbers $$1, 2, 4, ..... $$ $${2^n},$$ $$.....$$ written in unary.

The set of binary strings in which the numbers of zeros is the same as the numbers of ones.

The set $$\left\{ {1,101,11011,1110111,...} \right\}.$$

GATE CSE 1998

MCQ (More than One Correct Answer)

-0

The string $$1101$$ does not belong to the set represented by

$${110^ * }\,\,\left( {0 + 1} \right)$$

$$\,1\,{\left( {0 + 1} \right)^ * }101$$

$${\left( {10} \right)^ * }\,{\left( {01} \right)^ * }\,{\left( {00 + 11} \right)^ * }$$

$${\left( {00 + {{\left( {11} \right)}^ * }0} \right)^ * }$$

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

How many substrings of different lengths (non-zero) can be formed from a character string of length $$n$$ ?

$$n$$

$${n^2}$$

$${2^n}$$

$$n\left( {n + 1} \right)/2$$

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