Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
How to solve?
Recent questions tagged identify-class-language
3
votes
1
answer
61
Zeal Test Series 2019: Theory of Computation - Identify Class Language
select the correct statement Non-CFL is closed under reversal operation . L=$ \{ \;0^n1^m0^m: n+m \; mod \;6 =2 \} $ is CFL but not regular. if L is context free and R and S are regular ,then MAJORITY(L,R,S)={ w| w is in atleast two of R,L,S } is also context free (a) only i (b) only I and II (c) Only II and III (d) All
Prince Sindhiya
asked
in
Theory of Computation
Nov 25, 2018
by
Prince Sindhiya
825
views
zeal
theory-of-computation
identify-class-language
zeal2019
0
votes
1
answer
62
Testbook Test Series: Theory of Computation - Identify Class Language
Is L={1n0n0m | m+n>100} a regular language?
CS.user
asked
in
Theory of Computation
Oct 30, 2018
by
CS.user
627
views
testbook-test-series
theory-of-computation
identify-class-language
0
votes
0
answers
63
GateForum Test Series: Theory Of Computation - Identify Class Language
My answer is C but the answer provided is D.
Gupta731
asked
in
Theory of Computation
Oct 27, 2018
by
Gupta731
245
views
gateforum-test-series
theory-of-computation
identify-class-language
0
votes
0
answers
64
TOC Self Doubt
If L1 is CFL and L2 is Regular L. $L1\cap L2 = L3$ Then L3 is CFL. Can L3 be regular also sometimes and if L3 is CFL and Regular also does it employs L1 is also Regular ??
jatin khachane 1
asked
in
Theory of Computation
Oct 14, 2018
by
jatin khachane 1
586
views
theory-of-computation
regular-language
identify-class-language
0
votes
0
answers
65
Concatenation of DCFLs
L1={an bn | n>=0} L2={bn cn | n>=0} What is L1.L2 ? Is it an b2n cn ?
sripo
asked
in
Theory of Computation
Oct 13, 2018
by
sripo
602
views
theory-of-computation
dcfl
context-free-language
identify-class-language
1
vote
0
answers
66
language class
L = { (ak.bp)p.an.bn | k,p,n>=0 } is this regular or cfl?
Lone Wolf
asked
in
Theory of Computation
Oct 3, 2018
by
Lone Wolf
258
views
identify-class-language
2
votes
2
answers
67
Regular Language
Is the given Grammer represent a regular language ? S->AaB A->aC | epsilon B->aB | bB | epsilon C->aCb | epsilon
Na462
asked
in
Theory of Computation
Sep 13, 2018
by
Na462
708
views
theory-of-computation
regular-language
finite-automata
regular-expression
identify-class-language
1
vote
1
answer
68
Regular language identification
Is Language L = {0(n+m) 1(k+l) | m = l, and m,n,k,l ≥ 1 } a regular language ? explain
Na462
asked
in
Theory of Computation
Sep 11, 2018
by
Na462
1.6k
views
theory-of-computation
identify-class-language
regular-language
regular-expression
1
vote
2
answers
69
Testbook Test Series: Theory of Computation - Identify Class Language
Doubt 1: according to me L1 should be subset of L2. But answer is d) L1,L2,L3 are incomparable. Please explain this question to me Doubt 2: which type of language is L4?
Ananya Jaiswal 1
asked
in
Theory of Computation
Aug 11, 2018
by
Ananya Jaiswal 1
696
views
testbook-test-series
theory-of-computation
identify-class-language
2
votes
2
answers
70
Zeal Test Series 2019: Theory of Computation - Identify Class Language
Which of the following is CFL ? a) L1 is CFL b)L1 is CFL but L2 is not CFL c)Both L1 and L2 are CFL d) None
Prince Sindhiya
asked
in
Theory of Computation
Aug 3, 2018
by
Prince Sindhiya
1.1k
views
zeal
theory-of-computation
identify-class-language
zeal2019
0
votes
1
answer
71
Language Regular or not
Is it regular? $\left \{ \left ( 0^{n} \right )^{m}|n<m,n,m\geq 1 \right \}$
srestha
asked
in
Theory of Computation
May 24, 2018
by
srestha
784
views
theory-of-computation
regular-language
identify-class-language
2
votes
1
answer
72
Prove that language is CFL
$ L= \{ w1 w2 | w1,w2 ∈Σ^{+} ,w1!=w2 \} $ How can i prove that it is CFL?
rahul sharma 5
asked
in
Theory of Computation
Apr 10, 2018
by
rahul sharma 5
914
views
theory-of-computation
identify-class-language
1
vote
1
answer
73
Language Identification
Under Which class of language , Set of binary strings represents Fibonacci Sequence over input alphabet {0,1} ? I think either it is Context Sensitive Language or Recursive Language. Can anyone please help me ?
ankitgupta.1729
asked
in
Theory of Computation
Feb 24, 2018
by
ankitgupta.1729
294
views
theory-of-computation
identify-class-language
50
votes
9
answers
74
GATE CSE 2018 | Question: 35
Consider the following languages: $\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$ $\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \geq 0 \}$ ... Which of the above languages are context-free? I and IV only I and II only II and III only II and IV only
gatecse
asked
in
Theory of Computation
Feb 14, 2018
by
gatecse
21.2k
views
gatecse-2018
theory-of-computation
identify-class-language
context-free-language
normal
2-marks
4
votes
0
answers
75
Testbook Test Series: Theory of Computation - Identify Class Language
Shailin Shah
asked
in
Theory of Computation
Jan 30, 2018
by
Shailin Shah
573
views
testbook-test-series
identify-class-language
theory-of-computation
1
vote
1
answer
76
MadeEasy Test Series 2018: Theory of Computation - Identify Class Language
Isn't the second one is CFL?
Sukhdip Singh
asked
in
Theory of Computation
Jan 28, 2018
by
Sukhdip Singh
385
views
theory-of-computation
identify-class-language
made-easy-test-series
4
votes
2
answers
77
Virtual Gate Test Series: Theory Of Computation - Languages
Let $L$ be a given context-free language over the alphabet $\{a, b\}$. Construct $L1, L2$ as follows. Let $L1 = L − \{xyx \mid x, y \in \{a, b\}^*\}$, and $L2 = L·L$. Then, Both $L1$ and $L2$ are regular ... $L1$ is regular and $L2$ is context-free. $L1$ and $L2$ both may not be context-free.
Utsav09
asked
in
Theory of Computation
Jan 27, 2018
by
Utsav09
562
views
theory-of-computation
identify-class-language
virtual-gate-test-series
2
votes
2
answers
78
MadeEasy Test Series 2018: Theory of Computation - Identify Class Language
sumit chakraborty
asked
in
Theory of Computation
Jan 27, 2018
by
sumit chakraborty
550
views
theory-of-computation
identify-class-language
made-easy-test-series
3
votes
1
answer
79
Ace Test Series: Theory Of Computation - Identify Class Of Language
Can someone please explain me this question ?
ashish pal
asked
in
Theory of Computation
Jan 27, 2018
by
ashish pal
311
views
ace-test-series
theory-of-computation
identify-class-language
1
vote
0
answers
80
#toc001
Both the languages have x,y belongs {0,1} then what type of languages are both L1={x ∣x has an equal number of a's and b's} L2={xy | #a's in x = #b's in y} For L1 i think it is CFL , on a's push onto the stack on seeing b pop from stack, finally stack empty accept the lang. For L2 how to find middle of string where x is ending and y is starting....??
Anjan
asked
in
Theory of Computation
Jan 25, 2018
by
Anjan
232
views
theory-of-computation
identify-class-language
2
votes
1
answer
81
MadeEasy Test Series 2018: Theory of Computation - Identify Class Language
a) Only L1 is correct b)Only L2 is correct c)Both L1 and L2 are correct d)None of L1 and L2 is correct My question is: What is meant by prefix of string? And how is L1 regular?
Sumaiya23
asked
in
Theory of Computation
Jan 22, 2018
by
Sumaiya23
449
views
theory-of-computation
identify-class-language
made-easy-test-series
2
votes
1
answer
82
TOC - Language Interpretation
$L_1=\{a^nb^nc^n\ |n>=0\}$ $L_2=\{a^{2n}b^{2n}c^{2n}\ |n>=0\}$ $L_3=\{ a^{2n}b^{2n}c^n\ |n>=0\}$ Options : $1)\ L_2 \subseteq L_1 \&L_2 \subseteq L_3 $ $2)\ L_2 \subseteq L_1 \&L_2 \not\subset L_3 $
saxena0612
asked
in
Theory of Computation
Jan 9, 2018
by
saxena0612
467
views
theory-of-computation
identify-class-language
2
votes
1
answer
83
Context Free Language
Is B context free? Please explain in detail.
Shubham Kumar Gupta
asked
in
Theory of Computation
Jan 6, 2018
by
Shubham Kumar Gupta
840
views
context-free-language
theory-of-computation
identify-class-language
regular-language
grammar
1
vote
0
answers
84
Identify the language.
Identify the language. apbqcrds | p+r=q+s
gari
asked
in
Theory of Computation
Jan 1, 2018
by
gari
613
views
theory-of-computation
identify-class-language
2
votes
0
answers
85
Identify class of language
L={ (anbn)* | n>0 }
VS
asked
in
Theory of Computation
Dec 28, 2017
by
VS
575
views
theory-of-computation
identify-class-language
0
votes
1
answer
86
Class of LANGUAGE
Parshu gate
asked
in
Theory of Computation
Dec 21, 2017
by
Parshu gate
341
views
identify-class-language
theory-of-computation
0
votes
0
answers
87
Class of language
Parshu gate
asked
in
Theory of Computation
Dec 21, 2017
by
Parshu gate
179
views
theory-of-computation
identify-class-language
1
vote
0
answers
88
language identify
here my doubt is the language generated by above contain compression among substring or not.... what is a type of language is generated here??
Hira Thakur
asked
in
Theory of Computation
Dec 17, 2017
by
Hira Thakur
263
views
identify-class-language
13
votes
3
answers
89
TIFR CSE 2018 | Part B | Question: 14
Define the language $\text{INFINITE}_{DFA}\equiv \{(A)\mid A \text{ is a DFA and } L(A) \text{ is an infinite language}\},$ where $(A)$ denotes the description of the deterministic finite automata (DFA).Then which ... It is Turing decidable (recursive). It is Turing recognizable but not decidable. Its complement is Turing recognizable but it is not decidable.
Arjun
asked
in
Theory of Computation
Dec 10, 2017
by
Arjun
3.5k
views
tifr2018
theory-of-computation
identify-class-language
12
votes
2
answers
90
TIFR CSE 2018 | Part B | Question: 11
Consider the language $L\subseteq \left \{ a,b,c \right \}^{*}$ defined as $L = \left \{ a^{p}b^{q}c^{r} : p=q\quad or\quad q=r \quad or\quad r=p \right \}.$ Which of the following answer is TRUE about the complexity of this language ... defined as $\overline{L} = \left \{ a,b,c \right \}^{*}\backslash L,$ is regular. $L$ is regular, context-free and decidable
Arjun
asked
in
Theory of Computation
Dec 10, 2017
by
Arjun
2.5k
views
tifr2018
identify-class-language
theory-of-computation
Page:
« prev
1
2
3
4
5
6
7
8
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged identify-class-language
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...