1

GATE CSE 2000

MCQ (Single Correct Answer)

+1

-0.3

Let $$S$$ and $$T$$ be languages over $$\sum { = \left\{ {a,b} \right\}} $$ represented by the regular expressions $${\left( {a + {b^ * }} \right)^ * }$$ and $$\,{\left( {a + b} \right)^ * },$$ respectively. Which of the following is true?

2

GATE CSE 2000

MCQ (Single Correct Answer)

+1

-0.3

Let $$L$$ denote the language generated by the grammar $$S \to 0S\left. 0 \right|00.$$ Which one of the following is true?

3

GATE CSE 1999

MCQ (Single Correct Answer)

+1

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

4

GATE CSE 1998

MCQ (Single Correct Answer)

+1

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

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

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2022 (1)
GATE CSE 2020 (2)
GATE CSE 2019 (2)
GATE CSE 2016 Set 2 (2)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (2)
GATE CSE 2013 (1)
GATE CSE 2012 (1)
GATE CSE 2010 (1)
GATE CSE 2009 (1)
GATE CSE 2003 (2)
GATE CSE 2001 (2)
GATE CSE 2000 (2)
GATE CSE 1999 (1)
GATE CSE 1998 (4)
GATE CSE 1997 (1)
GATE CSE 1996 (2)
GATE CSE 1994 (1)

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