1

GATE CSE 1989

Subjective

+5

-0

Is the class of regular sets closed under infinite union? Explain.

2

GATE CSE 1987

Subjective

+5

-0

Give the regular expression over $${\left\{ {0,\,\,1} \right\}}$$ to denote the set of proper non-null substrings of the string $$0110$$.

3

GATE CSE 1987

Subjective

+5

-0

Give minimal $$DFA$$ that performs as a Mod-$$3$$ $$1's$$ counter, i.e., outputs a $$1$$ each time the number of $$1's$$ in the input sequence is a sequence is a multiple of $$3.$$

Questions Asked from Finite Automata and Regular Language (Marks 5)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages