1

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

+2

-0.6

Consider the transition diagram of a $$PDA$$ given below with input alphabet $$\sum {\, = \left\{ {a,b} \right\}} $$ and stack alphabet $$\Gamma = \left\{ {X,Z} \right\}.$$ $$Z$$ is the initial stack symbol. Let $$L$$ denote the language accepted by the $$PDA.$$

Which one of the following is **TRUE**?

2

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

+2

-0.6

Consider the NPDA $$\left\langle {Q = \left\{ {{q_0},{q_1},{q_2}} \right\}} \right.,$$ $$\Sigma = \left \{ 0, 1 \right \},$$ $$\Gamma = \left \{ 0, 1, \perp \right \},$$ $$\delta, q_{0}, \perp,$$ $$\left. {F = \left\{ {{q_2}} \right\}} \right\rangle $$ , where (as per usual convention) $$Q$$ is the set of states, $$\Sigma$$ is the input alphabet, $$\Gamma$$ is the stack alphabet, $$\delta $$ is the state transition function q

_{0}is the initial state, $$\perp$$ is the initial stack symbol, and F is the set of accepting states. The state transition is as follows:Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton?

3

GATE CSE 2015 Set 1

Numerical

+2

-0

Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is___________.

Your input ____

4

GATE CSE 2015 Set 2

Numerical

+2

-0

The number of states in the minimal deterministic finite automaton corresponding to the regular expression $${\left( {0 + 1} \right)^{\,\, * }}\left( {10} \right)$$ is ________________.

Your input ____

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

Number in Brackets after Paper Indicates No. of Questions

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

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