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
0
votes
0
answers
1
Test-Series
Consider the following language: $L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings } Which of the following is true about L? A)L is decidable B)L is Turing recognizable C)L is not recursive D)None of these
Pranavpurkar
asked
in
Theory of Computation
Nov 16
by
Pranavpurkar
101
views
theory-of-computation
test-series
identify-class-language
multiple-selects
0
votes
0
answers
2
Test-Series
Consider the language given below: $L$ $=$ { $p$ $|$ $p$ $\neq$ $w$ $and$ $p$ $is$ $the$ $prefix$ $of$ $w$ $and$ $w$ $\epsilon$ {$0,1$}*} Which of following is true about L. A)L is CFL B)L is DCFL C)L is CSL D)L is regular
Pranavpurkar
asked
in
Theory of Computation
Nov 16
by
Pranavpurkar
85
views
theory-of-computation
identify-class-language
test-series
1
vote
1
answer
3
Test-Series
Consider the following language given below: I. L1= { $p^xq^y$ |; x,y >0 } II. L2 = {$p^xq^yp^z$ |$ x>y$ , $y\geq 0$ and $z>0$} Which of the following is true about L1 intersection L2 ? A)It is CSL B)It is CFL C)It is regular D)It is non regular
Pranavpurkar
asked
in
Theory of Computation
Nov 13
by
Pranavpurkar
122
views
theory-of-computation
multiple-selects
identify-class-language
test-series
4
votes
2
answers
4
GATE CSE 2022 | Question: 13
Which of the following statements is/are $\text{TRUE}?$ Every subset of a recursively enumerable language is recursive. If a language $\textit{L}$ and its complement $\overline{\textit{L}}$ are both recursively enumerable, then $\textit{L}$ must be recursive. ... $\textit{L}_{1} \cap \textit{L}_{2}$ must be deterministic context-free.
Arjun
asked
in
Theory of Computation
Feb 15
by
Arjun
4.2k
views
gatecse-2022
theory-of-computation
identify-class-language
recursive-and-recursively-enumerable-languages
multiple-selects
1-mark
8
votes
2
answers
5
GATE CSE 2022 | Question: 37
Consider the following languages: $L_{1} = \{ a^{n} wa^{n} | w \in \{a,b\}^{\ast}\}$ $L_{2} = \{wxw^{R} | w, x \in \{a,b\}^{*}, |w|, |x| > 0 \}$ Note that $w^{R}$ is the reversal of the string $w.$ Which of the following is/are ... $L_{2}$ are context-free. $L_{1}$ is regular and $L_{2}$ is context-free. $L_{1}$ and $L_{2}$ are context-free but not regular.
Arjun
asked
in
Theory of Computation
Feb 15
by
Arjun
1.7k
views
gatecse-2022
theory-of-computation
identify-class-language
context-free-language
multiple-selects
2-marks
1
vote
2
answers
6
Made Easy Test Series
Why option B is wrong
Nihal Singh
asked
in
Theory of Computation
Sep 21, 2021
by
Nihal Singh
329
views
theory-of-computation
identify-class-language
0
votes
3
answers
7
UGC NET CSE | December 2019 | Part 2 | Question: 48
Consider the following languages: $L_1 = \{ a^nb^nc^m \} \cup \{a^nb^mc^m\}, n, m \geq 0$ $L_2 =\{ww^R \mid w \in\{ a, b \}^*\}$ Where $R$ represents reversible operation. Which one of the following is (are) inherently ambiguous languages(s)? Only $L_1$ Only $L_2$ both $L_1$ and $L_2$ neither $L_1$ nor $L_2$
soujanyareddy13
asked
in
Theory of Computation
May 12, 2021
by
soujanyareddy13
400
views
ugcnetcse-dec2019-paper2
identify-class-language
11
votes
2
answers
8
GATE CSE 2021 Set 2 | Question: 12
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free? $L_1 \cap \overline{L_2} \\$ $\overline{\overline{L_1} \cup \overline{L_2}} \\$ $L_1 \cup (L_2 \cup \overline{L_2}) \\$ $(L_1 \cap L_2) \cup (\overline{L_1} \cap L_2)$
Arjun
asked
in
Theory of Computation
Feb 18, 2021
by
Arjun
5.4k
views
gatecse-2021-set2
multiple-selects
theory-of-computation
identify-class-language
1-mark
0
votes
1
answer
9
UGC NET CSE | October 2020 | Part 2 | Question: 71
Match $\text{List I}$ with $\text{List II}$ $L_R:$ Regular language, $LCF$: Context free language $L_{REC}:$ Recursive langauge, $L_{RE}$ ... $A-III, B-I, C-II$ $A-I, B-II, C-III$ $A-II, B-I, C-III$
go_editor
asked
in
Theory of Computation
Nov 20, 2020
by
go_editor
381
views
ugcnetcse-oct2020-paper2
theory-of-computation
identify-class-language
1
vote
1
answer
10
NIELIT 2016 MAR Scientist C - Section C: 14
If every string of a language can be determined, whether it is legal or illegal in finite time, the language is called decidable undecidable interpretive non-deterministic
Lakshman Patel RJIT
asked
in
Theory of Computation
Apr 2, 2020
by
Lakshman Patel RJIT
1.1k
views
nielit2016mar-scientistc
theory-of-computation
identify-class-language
0
votes
1
answer
11
NIELIT 2016 MAR Scientist C - Section C: 15
The defining language for developing a formalism in which language definitions can be stated, is called syntactic meta language decidable language intermediate language high level language
Lakshman Patel RJIT
asked
in
Theory of Computation
Apr 2, 2020
by
Lakshman Patel RJIT
409
views
nielit2016mar-scientistc
theory-of-computation
identify-class-language
non-gate
1
vote
2
answers
12
NIELIT 2017 DEC Scientific Assistant A - Section B: 31
A finite automaton accepts which type of language : Type $0$ Type $1$ Type $2$ Type $3$
Lakshman Patel RJIT
asked
in
Theory of Computation
Mar 31, 2020
by
Lakshman Patel RJIT
2.1k
views
nielit2017dec-assistanta
theory-of-computation
identify-class-language
finite-automata
1
vote
2
answers
13
NIELIT 2016 MAR Scientist B - Section C: 25
Regarding power of recognition of language, which of the following statements is false? Non deterministic finite-state automata are equivalent to deterministic finite-state automata. Non-deterministic push-down automata are equivalent to ... to deterministic push-down automata. Multi-tape Turing Machines are equivalent to Single-tape Turing Machines.
Lakshman Patel RJIT
asked
in
Theory of Computation
Mar 31, 2020
by
Lakshman Patel RJIT
884
views
nielit2016mar-scientistb
theory-of-computation
identify-class-language
2
votes
3
answers
14
NIELIT 2017 DEC Scientist B - Section B: 56
Which of the following statement is true? Deterministic context free language are closed under complement. Deterministic context free language are not closed under Union. Deterministic context free language are closed under intersection with regular set. All of the options
Lakshman Patel RJIT
asked
in
Theory of Computation
Mar 30, 2020
by
Lakshman Patel RJIT
975
views
nielit2017dec-scientistb
theory-of-computation
identify-class-language
context-free-language
1
vote
2
answers
15
NIELIT 2017 DEC Scientist B - Section B: 58
Which of the following is a correct hierarchical relationships of the following where $L_1$: set of languages accepted by NFA $L_2$: set of languages accepted by DFA $L_3$: set of languages accepted by DPDA $L_4$: set of languages ... $L_1\subset L_2\subset L_3\subset L_4\subset L_6\subset L_5$
Lakshman Patel RJIT
asked
in
Theory of Computation
Mar 30, 2020
by
Lakshman Patel RJIT
759
views
nielit2017dec-scientistb
theory-of-computation
identify-class-language
recursive-and-recursively-enumerable-languages
0
votes
2
answers
16
UGC NET CSE | January 2017 | Part 3 | Question: 61
Given the following two statements: $L=\{w\mid n_{a}(w)=n_{b}(w)\}$ is deterministic context free language, but not linear. $L=\{a^{n}b^{n}\} \cup \{a^{n}b^{2n} \}$ is linear, but not deterministic context free language. Which of the following ... (B) are false. Both (A) and (B) are true. (A) is true, (B) is false. (A) is false, (B) is true.
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
534
views
ugcnetcse-jan2017-paper3
identify-class-language
19
votes
6
answers
17
GATE CSE 2020 | Question: 10
Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements. $L$ is deterministic context-free. $L$ is context-free but not deterministic context-free. $L$ is not $LL(k)$ for any $k$. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Ⅰ and Ⅲ only Ⅲ only
Arjun
asked
in
Theory of Computation
Feb 12, 2020
by
Arjun
14.7k
views
gatecse-2020
theory-of-computation
identify-class-language
1-mark
18
votes
3
answers
18
GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.
Arjun
asked
in
Theory of Computation
Feb 12, 2020
by
Arjun
12.0k
views
gatecse-2020
theory-of-computation
identify-class-language
2-marks
1
vote
1
answer
19
Self doubt
$L=\{wxyw|w,x,y\in (a+b)^+ \}$ $L$ is ? Regular Deterministic CFL Non-deterministic CFL CSL
Verma Ashish
asked
in
Theory of Computation
Mar 28, 2019
by
Verma Ashish
214
views
theory-of-computation
identify-class-language
Page:
1
2
3
4
5
6
...
8
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged identify-class-language
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...