1

GATE CSE 1995

MCQ (Single Correct Answer)

+2

-0.6

A finite state machine with the following state table has a single input $$X$$ and a single out $$Z$$.

If the initial state is unknown, then the shortest input sequence to reach the final state $$C$$ is here, since initial make unknown $$m$$ $$10$$ input we can each final state $$C$$ with shortest path.

2

GATE CSE 1995

MCQ (Single Correct Answer)

+2

-0.6

Which of the following definitions below generates the same language as $$L$$

Where $$L = {\left\{ x \right.^n}{y^n}\left| {n \ge \left. 1 \right\}} \right.$$

i) $$\,\,E \to xEy\left| {xy} \right.$$

ii) $$\,\,xy\left| {\left( {{x^ + }xy{y^ + }} \right)} \right.$$

iii) $${\,\,{x^ + }{y^ + }}$$

$$L = \left\{ {xn\,{y^n}\left| {n \ge 1} \right.} \right\} - $$ generates string where equal no. of $$x$$ and equal no. of $$y's.$$

$$E \to XBy\left| {xy\,abo} \right.$$ generators tips same.

Where $$L = {\left\{ x \right.^n}{y^n}\left| {n \ge \left. 1 \right\}} \right.$$

i) $$\,\,E \to xEy\left| {xy} \right.$$

ii) $$\,\,xy\left| {\left( {{x^ + }xy{y^ + }} \right)} \right.$$

iii) $${\,\,{x^ + }{y^ + }}$$

$$L = \left\{ {xn\,{y^n}\left| {n \ge 1} \right.} \right\} - $$ generates string where equal no. of $$x$$ and equal no. of $$y's.$$

$$E \to XBy\left| {xy\,abo} \right.$$ generators tips same.

3

GATE CSE 1994

Fill in the Blanks

+2

-0

The regular expression for the language recognized by the finite state automation of is _________.

4

GATE CSE 1994

MCQ (Single Correct Answer)

+2

-0.6

The number of sub-strings (of all lengths inclusive) that can be formed from a character string of length $$n$$ is

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