GATE CSE 1999 | Finite Automata and Regular Language Question 79 | Theory of Computation

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the language represented by this regular expression contains:

$$n$$ states

$$n+1$$ states

$$n+2$$ states

None of the above

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$$

GATE CSE 1998

MCQ (More than One Correct Answer)

-0.3

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

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\}.$$

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

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

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

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 Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory