GATE CSE 1989 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1989

MCQ (More than One Correct Answer)

-0

Context free languages and regular languages are both closed under the operation(s) of :

Union

Intersection

Concatenation

Complementation

GATE CSE 1989

MCQ (More than One Correct Answer)

-0

Which of the following problems are un-decidable?

Membership problem in context - free languages.

Whether a given context - free language is regular.

Whether a finite state automation halts on all inputs.

Membership problem for type $$0$$ languages.

GATE CSE Papers

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

1988

1987