GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Answers by Gabbar
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
time complexity
what the time complexity for T(n)=5T(n/2)+n^2 a. n b.n^2
answered
5 days
ago
in
Algorithms

61
views
timecomplexity
0
votes
2
Doubt
Is it possible to prove number of b's=2k+1 and any number of a's is regular using Myhill–Nerode theorem ?
answered
May 6
in
Theory of Computation

25
views
theoryofcomputation
0
votes
3
Peter Linz Exercise 7.3
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ? #4 : Is the language L={anbn : n>=1} U {a} deterministic ? #7 Is the following regular language deterministic? L= { anbmck : n=m or m=k } #8 Is ... WR has started. #11 No Idea about it. Please someone verify and tell me is my way of analysis and the analysis is correct or not?
answered
Mar 31
in
Theory of Computation

91
views
theoryofcomputation
deterministiccontextfreegrammars
contextfreelanguage
24,141
questions
31,143
answers
70,892
comments
29,467
users