1

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

+1

-0.3

Let $$L$$ be the language represented by the regular expression $$\sum {^ * 0011\sum {^ * } } $$ where $$\sum { = \left\{ {0,1} \right\}} .$$ What is the minimum number of states in a $$DFA$$ that recognizes $$\overline L $$ (complement of $$L$$)?

2

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

+1

-0.3

Which one of the following is

**TRUE?**3

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

+1

-0.3

Consider the finite automation in the following figure.

What is the set of reachable states for the input string $$0011?$$

4

GATE CSE 2014 Set 3

Numerical

+1

-0

The length of the shortest string NOT in the language (over $$\sum { = \left\{ {a,\,\,b} \right\}} $$) of the following regular expression is ____________.
$$$a{}^ * b{}^ * \left( {ba} \right){}^ * a{}^ * $$$

Your input ____

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

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
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 1 (2)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 2 (1)
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

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude