The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged theory
0
votes
1
answer
1
Context Free Languages
What is the difference between regular intersection and intersection? (I found out that CFL is closed under regular intersection but not under intersection) Thanks!
asked
Jan 22
in
Theory of Computation
by
Abhipsa Mishra
(
83
points)

25
views
contextfreelanguage
theoryofcomputation
contextfreelanguages
theory
0
votes
1
answer
2
Turing machine
What is the meaning of non trivial property related to a language. Please explain with an example.
asked
Oct 30, 2018
in
Theory of Computation
by
Lovejeet Singh
(
31
points)

35
views
turingmachine
theory
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+3
votes
1
answer
3
Draw DFA
create a dfa with odd occurrence of sub string "abb" .and short cut for finding no.of states
asked
Jan 29, 2018
in
Theory of Computation
by
all mix
(
83
points)

117
views
theory
of
theoryofcomputation
+1
vote
1
answer
4
Context Free Languages
Please Explain in detail.
asked
Dec 23, 2017
in
Theory of Computation
by
Shubham Kumar Gupta
(
443
points)

89
views
contextfreelanguage
theoryofcomputation
contextfreelanguages
theory
+1
vote
1
answer
5
Context free languages
Consider the statements (I) Regular (II) DCFL but not regular (III) CFL but not DCFL Now consider the three languages L1, L2,L3 given below , and choose the correct option. (L1) {aibjcki=k or j=k} (L2) {aibjfor every prefix of the string n(a)n(b)≤2 ... (a)n(b)≤2 for all strings} what will be the correct matching ? i know L1 is CFL but not DCFL , what about L2 and L3?
asked
Oct 27, 2017
in
Theory of Computation
by
shaurya vardhan
Active
(
2.1k
points)

205
views
contextfreelanguage
theoryofcomputation
contextfreelanguages
theory
+6
votes
0
answers
6
Important Discussions in GO
Here are some HOT Conceptual Discussions made in GateOverflow . You can add in comments if you find any discussions in GO on any topic . These discussion will improve concetual understanding and it also helps in quick revision of the topics ... ://gateoverflow.in/113244/doubtsinpipelining CN Token Bucket : https://gateoverflow.in/100232/tokenbucketgate2016question
asked
Sep 22, 2017
in
GATE
by
pC
Boss
(
21.3k
points)

154
views
longanswer
theory
conceptualquestions
0
votes
1
answer
7
Understanding Confusion and Diffusion  Network Security
Explain Confusion and Diffusion How it is implemented in DES AES
asked
Sep 19, 2017
in
Interview Questions
by
pC
Boss
(
21.3k
points)

309
views
computernetworks
networksecurity
conceptualquestions
theory
+2
votes
1
answer
8
regular language
C = {ak  k is multiple of n }. Then how to show that for each n>=1, the language C is regular.
asked
Aug 22, 2017
in
Theory of Computation
by
amrendra pal
Active
(
2.2k
points)

59
views
turingmachine
regularlanguages
theory
of
theoryofcomputation
0
votes
1
answer
9
Context free languages and Regular Languages
Let L be CFL and M a regular language. Language L ⋂ M is always (a) always regular (b) never regular (c) always DCFL (d) always context free language
asked
Aug 20, 2017
in
Theory of Computation
by
codingo1234
Junior
(
811
points)

93
views
theory
theoryofcomputation
contextfreelanguage
+2
votes
0
answers
10
help in theory of computation
I want to start the subject theory of computation from scratch, I don't have any prior knowledge of anything about TOC, so please suggest steps , in which sequence should I do this topics ?
asked
Aug 2, 2017
in
Theory of Computation
by
ashishji
(
171
points)

49
views
theory
theoryofcomputation
help
+3
votes
0
answers
11
inverse function
Q. Let f be a function from A to B. Let S and T be subsets of B. Show that a) f−1(S ∪ T ) = f−1(S) ∪ f−1(T ). b) f−1(S ∩ T ) = f−1(S) ∩ f−1(T ).
asked
Jan 11, 2016
in
Set Theory & Algebra
by
Pooja Palod
Boss
(
31.1k
points)

109
views
sets
theory
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Recruitment to the post of Scientist/Engineer 'SC' (Electronics, Mechanical and Computer Science)
Standard Videos for Calculus
Standard Videos for Linear Algebra
Standard Videos for Graph Theory
Standard Videos for Combinatory
Follow @csegate
Recent questions tagged theory
Recent Blog Comments
Exam date is 1212020.
Where is this mentioned?
Nope :(
is it for final year student or not??
12Jan2020 exam date
50,309
questions
55,731
answers
192,186
comments
90,358
users