Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
How to solve?
Recent questions tagged identify-class-language
1
votes
1
answer
31
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
If every string of a language can be determined, whether it is legal or illegal in finite time, the language is calleddecidableundecidableinterpretivenon-deterministic
admin
1.6k
views
admin
asked
Apr 2, 2020
Theory of Computation
nielit2016mar-scientistc
theory-of-computation
identify-class-language
+
–
0
votes
1
answer
32
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
The defining language for developing a formalism in which language definitions can be stated, is calledsyntactic meta languagedecidable languageintermediate languagehigh ...
admin
631
views
admin
asked
Apr 2, 2020
Theory of Computation
nielit2016mar-scientistc
theory-of-computation
identify-class-language
non-gate
+
–
1
votes
2
answers
33
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$
A finite automaton accepts which type of language : Type $0$Type $1$Type $2$Type $3$
admin
3.3k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
identify-class-language
finite-automata
+
–
1
votes
2
answers
34
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.
Regarding power of recognition of language, which of the following statements is false?Non deterministic finite-state automata are equivalent to deterministic finite-stat...
admin
1.3k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
identify-class-language
+
–
2
votes
3
answers
35
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
Which of the following statement is true?Deterministic context free language are closed under complement.Deterministic context free language are not closed under Union.De...
admin
1.5k
views
admin
asked
Mar 30, 2020
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
identify-class-language
context-free-language
+
–
1
votes
2
answers
36
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$
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$: ...
admin
1.4k
views
admin
asked
Mar 30, 2020
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
identify-class-language
recursive-and-recursively-enumerable-languages
+
–
0
votes
2
answers
37
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 ... (ii) are false. Both (i) and (ii) are true. (i) is true, (ii) is false. (i) is false, (ii) is true.
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 line...
go_editor
1.4k
views
go_editor
asked
Mar 24, 2020
Theory of Computation
ugcnetcse-jan2017-paper3
identify-class-language
+
–
29
votes
7
answers
38
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
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...
Arjun
19.9k
views
Arjun
asked
Feb 12, 2020
Theory of Computation
gatecse-2020
theory-of-computation
identify-class-language
1-mark
+
–
33
votes
4
answers
39
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.
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 \} \e...
Arjun
17.8k
views
Arjun
asked
Feb 12, 2020
Theory of Computation
gatecse-2020
theory-of-computation
identify-class-language
2-marks
+
–
1
votes
2
answers
40
ISRO2020-40
Which of the following classes of languages can validate an $\text{IPv4}$ address in dotted decimal format? It is to be ensured that the decimal values lie between $0$ and $255$. RE and higher CFG and higher CSG and higher Recursively enumerable language
Which of the following classes of languages can validate an $\text{IPv4}$ address in dotted decimal format? It is to be ensured that the decimal values lie between $0$ an...
Satbir
2.3k
views
Satbir
asked
Jan 13, 2020
Theory of Computation
isro-2020
theory-of-computation
normal
identify-class-language
+
–
1
votes
1
answer
41
Self doubt
$L=\{wxyw|w,x,y\in (a+b)^+ \}$ $L$ is ? Regular Deterministic CFL Non-deterministic CFL CSL
$L=\{wxyw|w,x,y\in (a+b)^+ \}$$L$ is ?RegularDeterministic CFLNon-deterministic CFLCSL
Verma Ashish
360
views
Verma Ashish
asked
Mar 28, 2019
Theory of Computation
theory-of-computation
identify-class-language
+
–
1
votes
2
answers
42
Virtual Gate Test Series: Theory Of Computation - Languages
If $L = \Bigl \{ x \mid x \in \{ a, b, c \}^*, \text{The length of $x$ is a square } \Bigr \}$ then $L$ is Regular Recursive but not context free Context Free but not regular None of the above
If $L = \Bigl \{ x \mid x \in \{ a, b, c \}^*, \text{The length of $x$ is a square } \Bigr \}$ then $L$ isRegularRecursive but not context freeContext Free but not regula...
aditi19
604
views
aditi19
asked
Mar 24, 2019
Theory of Computation
theory-of-computation
identify-class-language
virtual-gate-test-series
+
–
1
votes
1
answer
43
Virtual Gate Test Series: Theory Of Computation - Languages
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: L := {xy | x, y ∈ Σ* , na(x) = nb(y)} What can we say about L? L is regular, but not context-free. L is context-free, but not regular. L is Σ*. None of these.
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language:L := {xy ...
jatin khachane 1
330
views
jatin khachane 1
asked
Jan 26, 2019
Theory of Computation
theory-of-computation
identify-class-language
virtual-gate-test-series
+
–
0
votes
1
answer
44
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...
Mayankprakash
294
views
Mayankprakash
asked
Jan 24, 2019
Theory of Computation
theory-of-computation
identify-class-language
+
–
3
votes
1
answer
45
Testbook Test Series: Theory of Computation - Identify Class Language
Consider the infinite two-dimensional grid G={(m,n)| m and n are integers} Every point in G has 4 neighbors, North, South, East, and West, obtained by varying m or n by 1. Starting at the origin (0,0), a ... the following statements is TRUE? i) L is Regular. ii) L is context free. iii) L complement is context free. Thanks!
Consider the infinite two-dimensional grid G={(m,n)| m and n are integers}Every point in G has 4 neighbors, North, South, East, and West, obtained by varying m or n by �...
Abhipsa
424
views
Abhipsa
asked
Jan 22, 2019
Theory of Computation
testbook-test-series
theory-of-computation
identify-class-language
+
–
2
votes
0
answers
46
MadeEasy Full Length Test 2019: Theory of Computation - Identify Class Languages
Consider the following language over ∑={0,1} $L_{1} = \left \{ a^{\left \lfloor \frac{m}{n} \right \rfloor}| m,n \geq 1; n<m \right \}$ $L_{2} = \left \{ a^{m^{n}}| m,n \geq 1; n<m \right \}$ Which of them are regular? Both L1 and L2 Only L2 Only L1 None Ans. A. Both Please explain.
Consider the following language over ∑={0,1}$L_{1} = \left \{ a^{\left \lfloor \frac{m}{n} \right \rfloor}| m,n \geq 1; n<m \right \}$$L_{2} = \left \{ a^{m^{n}}| m,n \...
MiNiPanda
945
views
MiNiPanda
asked
Jan 15, 2019
Theory of Computation
identify-class-language
theory-of-computation
made-easy-test-series
+
–
1
votes
1
answer
47
MadeEasy Test Series: Theory Of Computation - Identify Class Language
$L = \left \{ x^{l}y^{m}z^{n} | \ l+m+n\ is\ divisible\ by\ 5\right \}$ Is it regular or CFL or CSL ?
$L = \left \{ x^{l}y^{m}z^{n} | \ l+m+n\ is\ divisible\ by\ 5\right \}$Is it regular or CFL or CSL ?
jatin khachane 1
682
views
jatin khachane 1
asked
Jan 8, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
0
votes
0
answers
48
TOC languages
please tell me if i am wrong
please tell me if i am wrong
VIDYADHAR SHELKE 1
222
views
VIDYADHAR SHELKE 1
asked
Jan 5, 2019
Theory of Computation
identify-class-language
+
–
2
votes
1
answer
49
#TOC identify languages.
If all finite subsets of LL are regular, then LL is regular. If a proper subset of LL is not regular, then LL is not regular. Subsets of finite sets are always regular. Subsets of finite sets are always regular. Every subset of language is regular than L is regular.
If all finite subsets of LL are regular, then LL is regular.If a proper subset of LL is not regular, then LL is not regular.Subsets of finite sets are always regular.Subs...
iarnav
793
views
iarnav
asked
Dec 28, 2018
Theory of Computation
theory-of-computation
identify-class-language
+
–
1
votes
0
answers
50
Zeal Test Series 2019: Theory of Computation - Identify Class Language
Prince Sindhiya
371
views
Prince Sindhiya
asked
Dec 21, 2018
Theory of Computation
zeal
theory-of-computation
identify-class-language
zeal2019
+
–
9
votes
2
answers
51
TIFR CSE 2019 | Part B | Question: 10
Let the language $D$ be defined in the binary alphabet $\{0,1\}$ as follows: $D:= \{ w \in \{0,1\}^* \mid \text{ substrings 01 and 10 occur an equal number of times in w} \}$ For example , $101 \in D$ while $1010 \notin D$ ... $D$ is context-free but not regular $D$ is decidable but not context-free $D$ is decidable but not in NP $D$ is undecidable
Let the language $D$ be defined in the binary alphabet $\{0,1\}$ as follows:$D:= \{ w \in \{0,1\}^* \mid \text{ substrings 01 and 10 occur an equal number of times in w}...
Arjun
2.0k
views
Arjun
asked
Dec 18, 2018
Theory of Computation
tifr2019
theory-of-computation
identify-class-language
+
–
4
votes
3
answers
52
Regular language
L={a^m b^n | m-n=even} Is this language a regular language?
L={a^m b^n | m-n=even} Is this language a regular language?
AIkiran01
3.8k
views
AIkiran01
asked
Dec 12, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-language
regular-expression
identify-class-language
+
–
0
votes
0
answers
53
VirtualGate CFL or Regular language Identification
For $\text{A, B} \subseteq \Sigma^*,$ define $A/B = \{x \in \Sigma^* | \exists y \in B , xy \in A \}$ If L is a CFL and R is regular, then L/R is Regular CFL but not regular Recursive but not CFL None of the above ... are not regular but they are CFL. Hence, $L/R$ is CFL but not Regular. Please advise me that am I thinking in correct way or not?
For $\text{A, B} \subseteq \Sigma^*,$ define$A/B = \{x \in \Sigma^* | \exists y \in B , xy \in A \}$If L is a CFL and R is regular, then L/R isRegularCFL but not regula...
!KARAN
394
views
!KARAN
asked
Dec 8, 2018
Theory of Computation
theory-of-computation
identify-class-language
+
–
4
votes
1
answer
54
Zeal Test Series 2019: Theory of Computation - Identify Class Language
suppose we define max(L) = $ \{ \; x \;|\; x \in L,(\;\forall y \in \Sigma ^*,(y\neq \lambda )\Rightarrow (xy\notin L)\;\;) \;\}$ let L$_1$ = $ \{ \;a^ib^jc^k\;|\;k ≤i \;or\; k ≤j;where\; i,j,k ≥ 0 \;\}$ and L$_2$ ... CFL (c) max( L$_1$ ) is CFL but max( L$_2$ ) is not CFL. (d) max( L$_2$ ) is CFL but max( L$_1$ ) is not CFL.
suppose we define max(L) = $ \{ \; x \;|\; x \in L,(\;\forall y \in \Sigma ^*,(y\neq \lambda )\Rightarrow (xy\notin L)\;\;) \;\}$let L$_1$ = $ \{ \;a^ib^jc^k\;|\;k ≤i \...
Prince Sindhiya
1.1k
views
Prince Sindhiya
asked
Nov 25, 2018
Theory of Computation
zeal
theory-of-computation
identify-class-language
zeal2019
+
–
3
votes
0
answers
55
Zeal Test Series 2019: Theory of Computation - Identify Class Language
in this question L2 is regular and in first statement what i got that it is DCFL.COMPLEMENT(DCFL).regular and in 2 one DCFLunion regular 3 i am not getting , what i want that can anyone explain the properties of regular with nonregular or anylanguage with regular for this question
in this question L2 is regular and in first statement what i got that it isDCFL.COMPLEMENT(DCFL).regular and in 2 one DCFLunion regular 3 i am not getting ,what i want t...
Prince Sindhiya
287
views
Prince Sindhiya
asked
Nov 25, 2018
Theory of Computation
zeal
identify-class-language
theory-of-computation
zeal2019
+
–
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register