menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.4k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Hi, could you please update us about the Mock...
Hi, just curious if there are any updates...
thanks himanshu2021. But I am asking for the page...
But IISc hasn't mentioned TCS as one of their...
@kiioo https://gateoverflow.in/blog/11426/jest-20...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
type of language
0
votes
170
views
let L=(a,b,c)* | the length of x is square then L is -
a)Regular
b)recursive but not context free
c)context free but not regular
d)none of these.
identify-class-language
asked
Jan 27, 2016
in
Theory of Computation
Kamalkant Patel
170
views
answer
comment
1
it look like incomplete question
1
i think its B recursive but not CFL
0
Yes i think its option B recursive but not CFL
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
Yes It will be Recursive and can't be CFL bcz if the length is in square i.e power is non-linear and whenever the length is non linear like factorial, underoot etc then it can't be CFL
answered
Jan 28, 2016
akb1115
comment
0
L = (a+b+c)* , isn't it regular ?
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
0
answers
1
138
views
CFL , HOW TO SOLVE THESE TYPE OF PROBLEMS
asked
Nov 6, 2017
in
Theory of Computation
Parshu gate
138
views
theory-of-computation
context-free-languages
identify-class-language
1
vote
1
answer
2
133
views
Identify type of grammer
Identify type of grammer:- S-> a | $\epsilon$ 1. TYPE 0 2. TYPE 1 3. TYPE 2 4. TYPE 3
Identify type of grammer:- S-> a | $\epsilon$ 1. TYPE 0 2. TYPE 1 3. TYPE 2 4. TYPE 3
asked
Sep 11, 2017
in
Theory of Computation
rahul sharma 5
133
views
theory-of-computation
identify-class-language
0
votes
0
answers
3
110
views
How to identify the type of Grammer
Suppose We are given " set of productions " Then how can we identify the lamguage class ffrom them .? please explain giving examples to each language classes
Suppose We are given " set of productions " Then how can we identify the lamguage class ffrom them .? please explain giving examples to each language classes
asked
Jan 9, 2017
in
Theory of Computation
Anjana Babu
110
views
theory-of-computation
identify-class-language
0
votes
1
answer
4
86
views
Class of language
Please suggest me in briefly for revision . How to we test regular,dcfl,cfl,recursive and recursive enumeranle. Eg say if we can find the pattern it's regular. Please help
Please suggest me in briefly for revision . How to we test regular,dcfl,cfl,recursive and recursive enumeranle. Eg say if we can find the pattern it's regular. Please help
asked
Jan 24, 2019
in
Theory of Computation
Mayankprakash
86
views
theory-of-computation
identify-class-language
...