1

GATE CSE 2006

MCQ (Single Correct Answer)

+2

-0.6

Consider the regular language $$L = {\left( {111 + 11111} \right)^ * }.$$ The minimum number of states in any $$DFA$$ accepting this language is

2

GATE CSE 2005

MCQ (Single Correct Answer)

+2

-0.6

Consider the machine $$M:$$ The language recognized by $$M$$ is:

3

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

The following finite state machine accepts all those binary strings in which the number of $$1's$$ and $$0's$$ are respectively

4

GATE CSE 2003

MCQ (Single Correct Answer)

+2

-0.6

Consider the $$NFA$$ $$M$$ shown below.

Let the language accepted by $$M$$ be $$L.$$ Let $${L_1}$$ be the language accepted by the $$NFA$$, $${M_1}$$ obtained by changing the accepting state of $$M$$ to a non accepting state and by changing the non accepting state of $$M$$ to accepting states. Which of the following statements is true?

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

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (2)
GATE CSE 2024 Set 1 (2)
GATE CSE 2023 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2018 (2)
GATE CSE 2016 Set 2 (2)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 1 (2)
GATE CSE 2015 Set 2 (3)
GATE CSE 2014 Set 1 (1)
GATE CSE 2014 Set 2 (2)
GATE CSE 2013 (1)
GATE CSE 2012 (1)
GATE CSE 2011 (1)
GATE CSE 2010 (2)
GATE CSE 2009 (2)
GATE CSE 2008 (3)
GATE CSE 2007 (4)
GATE CSE 2006 (2)
GATE CSE 2005 (1)
GATE CSE 2004 (1)
GATE CSE 2003 (2)
GATE CSE 2002 (2)
GATE CSE 2001 (2)
GATE CSE 2000 (1)
GATE CSE 1998 (1)
GATE CSE 1997 (1)
GATE CSE 1995 (2)
GATE CSE 1994 (2)
GATE CSE 1992 (2)
GATE CSE 1991 (1)
GATE CSE 1990 (1)
GATE CSE 1989 (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