Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regular-language
2
votes
3
answers
91
GO Classes Test Series 2023 | Theory of Computation | Test 1 | Question: 23
Consider the language $\textsf{Pal}$ consisting of all palindromes over alphabet $\Sigma=\{0\}.$ Which of the following statements is/are False? $\textsf{Pal}$ is non-regular. Every infinite subset of $\textsf{Pal}$ ... . Every infinite superset of $\textsf{Pal}$ is regular. Every finite subset of $\textsf{Pal}$ is regular.
Consider the language $\textsf{Pal}$ consisting of all palindromes over alphabet $\Sigma=\{0\}.$Which of the following statements is/are False?$\textsf{Pal}$ is non-regul...
GO Classes
444
views
GO Classes
asked
Jun 9, 2022
Theory of Computation
goclasses2024-toc-1-weekly-quiz
goclasses
theory-of-computation
regular-language
multiple-selects
2-marks
+
–
1
votes
1
answer
92
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b} if yes then why please explain
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}if yes then why please explain
sachin_27
1.3k
views
sachin_27
asked
Jun 1, 2022
Theory of Computation
theory-of-computation
regular-language
pumping-lemma
context-free-language
+
–
2
votes
1
answer
93
NPTEL Assignment
Let L={w| w has even length and odd number of 0’s}. Which of the following words is in L* (Kleen Closure of L). 0000 010101 111101 010 Answer Is Given 0000
Let L={w| w has even length and odd number of 0’s}. Which of the following words is in L* (Kleen Closure of L).0000010101111101010 Answer Is Given 0000
lalitver10
2.6k
views
lalitver10
asked
Feb 16, 2022
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
1
votes
1
answer
94
regular languages - TOC
Which of the following languages is/are regular?
Which of the following languages is/are regular?
atulcse
488
views
atulcse
asked
Jan 28, 2022
Theory of Computation
regular-language
theory-of-computation
made-easy-test-series
+
–
0
votes
1
answer
95
#Empty_Language #ϕ #TOC #Doubt #Concatenation
I have a naive doubt about the below statement L. ϕ = ϕ. L = ϕ I want to know if the above statement holds true. If yes, can you please explain ?
I have a naive doubt about the below statementL. ϕ = ϕ. L = ϕI want to know if the above statement holds true. If yes, can you please explain ?
jiminpark
371
views
jiminpark
asked
Dec 29, 2021
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
2
votes
3
answers
96
Regular expressons
The minimum number of states in an equivalent finite automata for the given regular expression are _____ (a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
The minimum number of states in an equivalent finite automata for the given regular expression are _____(a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
coder97
701
views
coder97
asked
Oct 5, 2021
Theory of Computation
theory-of-computation
regular-expression
regular-language
finite-automata
+
–
2
votes
2
answers
97
KTU University Exam 2021
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language corresponds to regular expression r2. 2 3 1 none of the above
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language co...
Ash666
1.3k
views
Ash666
asked
Sep 12, 2021
Theory of Computation
theory-of-computation
regular-expression
regular-language
regular-grammar
+
–
1
votes
1
answer
98
CMI2015-B-01
Let $\Sigma=\{a,b\}.$ Given a language $L\underline\subset \Sigma^{\ast}$ and a word $w\in\Sigma^{\ast}$, define the languages: $Extend(L,w) :=\{xw\:|\:x\in L\}$ $Shrink(L,w) :=\{x\:|\:xw\in L\}$Show that if $L$ is regular, both $Extend(L,w)$ and $Shrink(L,w)$ are regular.
Let $\Sigma=\{a,b\}.$ Given a language $L\underline\subset \Sigma^{\ast}$ and a word $w\in\Sigma^{\ast}$, define the languages:$$Extend(L,w) :=\{xw\:|\:x\in L\}$$ $$Shrin...
soujanyareddy13
529
views
soujanyareddy13
asked
May 10, 2021
Theory of Computation
cmi2015
regular-language
theory-of-computation
+
–
20
votes
3
answers
99
GATE CSE 2021 Set 2 | Question: 9
Let $L \subseteq \{0,1\}^*$ be an arbitrary regular language accepted by a minimal $\text{DFA}$ with $k$ states. Which one of the following languages must necessarily be accepted by a minimal $\text{DFA}$ with $k$ states? $L-\{01\}$ $L \cup \{01\}$ $\{0,1\}^* – L$ $L \cdot L$
Let $L \subseteq \{0,1\}^*$ be an arbitrary regular language accepted by a minimal $\text{DFA}$ with $k$ states. Which one of the following languages must necessarily be ...
Arjun
9.3k
views
Arjun
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set2
theory-of-computation
finite-automata
regular-language
1-mark
+
–
32
votes
1
answer
100
GATE CSE 2021 Set 2 | Question: 36
Consider the following two statements about regular languages: $S_1$: Every infinite regular language contains an undecidable language as a subset. $S_2$: Every finite language is regular. Which one of the following choices is correct? Only $S_1$ is true Only $S_2$ is true Both $S_1$ and $S_2$ are true Neither $S_1$ nor $S_2$ is true
Consider the following two statements about regular languages:$S_1$: Every infinite regular language contains an undecidable language as a subset.$S_2$:...
Arjun
12.0k
views
Arjun
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set2
theory-of-computation
regular-language
decidability
2-marks
+
–
0
votes
2
answers
101
UGC NET CSE | October 2020 | Part 2 | Question: 56
Consider the following languages: $L_1=\{a^{\grave{z}^z} \mid \grave{Z} \text{ is an integer} \}$ $L_2=\{a^{z\grave{z}} \mid \grave{Z} \geq 0\}$ $L_3=\{ \omega \omega \mid \omega \epsilon \{a,b\}^*\}$ Which of ... (are) regular? Choose the correct answer from the options given below: $L_1$ and $L_2$ only $L_1$ and $L_3$ only $L_1$ only $L_2$ only
Consider the following languages:$L_1=\{a^{\grave{z}^z} \mid \grave{Z} \text{ is an integer} \}$$L_2=\{a^{z\grave{z}} \mid \grave{Z} \geq 0\}$$L_3=\{ \omega \omega \mid \...
go_editor
1.6k
views
go_editor
asked
Nov 20, 2020
Theory of Computation
ugcnetcse-oct2020-paper2
theory-of-computation
regular-language
+
–
1
votes
3
answers
102
NIELIT 2017 DEC Scientific Assistant A - Section B: 15
If $L1$ and $L2$ are regular sets then intersection of these two will be : Regular Non Regular Recursive Non Recursive
If $L1$ and $L2$ are regular sets then intersection of these two will be :RegularNon RegularRecursiveNon Recursive
admin
1.7k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
regular-language
+
–
4
votes
4
answers
103
NIELIT 2016 MAR Scientist B - Section C: 27
If $L$ be a language recognizable by a finite automaton, then language from $\{L\} = \{w$ such that $w$ is a prefix of $v$ where $v\in L\}$, is a regular language. context-free language. context-sensitive language. recursive enumeration language
If $L$ be a language recognizable by a finite automaton, then language from $\{L\} = \{w$ such that $w$ is a prefix of $v$ where $v\in L\}$, is aregular language.context-...
admin
892
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
regular-language
+
–
1
votes
4
answers
104
NIELIT 2016 MAR Scientist B - Section C: 28
Which of the following statements is correct? $A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular language Set $B$ of all strings of equal number of $a$'s and $b$'s defines a regular language $L(A^*B^*) \cap B$ gives the set $A$ None of these.
Which of the following statements is correct?$A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular languageSet $B$ of all strings of equal number of $a$'s and $b$'s defines a re...
admin
799
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
regular-language
+
–
0
votes
5
answers
105
UGC NET CSE | January 2017 | Part 3 | Question: 19
Which of the following are not regular? Strings of even number of a’s Strings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s. Strings of a’s whose length is a perfect square. (i) and (ii) only (i), (ii) and (iii) only (ii),(iii) and (iv) only (ii) and (iv) only
Which of the following are not regular?Strings of even number of a’sStrings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s...
go_editor
1.5k
views
go_editor
asked
Mar 24, 2020
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
1
votes
7
answers
106
UGC NET CSE | January 2017 | Part 3 | Question: 20
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$? $\{\in \}$ $\{\in,1\}$ $\phi$ $1^{\ast}$
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$?$\{\in \}$$\{\in,1\}$$\phi$$1^{...
go_editor
1.6k
views
go_editor
asked
Mar 24, 2020
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
3
votes
7
answers
107
UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... and (ii) are true (i) is true, (ii) is false (i) is false, (ii) is true
Given the following statements:A class of languages that is closed under union and complementation has to be closed under intersectionA class of languages that is closed ...
go_editor
2.7k
views
go_editor
asked
Mar 24, 2020
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
17
votes
3
answers
108
GATE CSE 2020 | Question: 8
Consider the following statements. If $L_1 \cup L_2$ is regular, then both $L_1$ and $L_2$ must be regular. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Both Ⅰ and Ⅱ Neither Ⅰ nor Ⅱ
Consider the following statements.If $L_1 \cup L_2$ is regular, then both $L_1$ and $L_2$ must be regular.The class of regular languages is closed under infinite union....
Arjun
13.6k
views
Arjun
asked
Feb 12, 2020
Theory of Computation
gatecse-2020
theory-of-computation
regular-language
1-mark
+
–
18
votes
7
answers
109
GATE CSE 2020 | Question: 51
Consider the following language. $L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$ The minimum number of states in DFA that accepts $L$ is _________
Consider the following language.$L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$The minimum number of states in DFA that ...
Arjun
13.5k
views
Arjun
asked
Feb 12, 2020
Theory of Computation
gatecse-2020
numerical-answers
theory-of-computation
regular-language
2-marks
+
–
3
votes
3
answers
110
ISRO2020-38
Which of the following is true? Every subset of a regular set is regular Every finite subset of non-regular set is regular The union of two non regular set is not regular Infinite union of finite set is regular
Which of the following is true?Every subset of a regular set is regularEvery finite subset of non-regular set is regularThe union of two non regular set is not regularInf...
Satbir
2.2k
views
Satbir
asked
Jan 13, 2020
Theory of Computation
isro-2020
theory-of-computation
regular-language
easy
+
–
0
votes
0
answers
111
Michael Sipser Edition 3 Exercise 5 Question 4 (Page No. 239)
If $A \leq_{m} B$ and $B$ is a regular language, does that imply that $A$ is a regular language? Why or why not?
If $A \leq_{m} B$ and $B$ is a regular language, does that imply that $A$ is a regular language? Why or why not?
admin
190
views
admin
asked
Oct 19, 2019
Theory of Computation
michael-sipser
theory-of-computation
regular-language
reduction
proof
+
–
0
votes
1
answer
112
Michael Sipser Edition 3 Exercise 2 Question 44 (Page No. 158)
If $A$ and $B$ are languages, define $A \diamond B = \{xy \mid x \in A\: \text{and}\: y \in B \;\text{and} \mid x \mid = \mid y \mid \}$. Show that if $A$ and $B$ are regular languages, then $A \diamond B$ is a CFL.
If $A$ and $B$ are languages, define $A \diamond B = \{xy \mid x \in A\: \text{and}\: y \in B \;\text{and} \mid x \mid = \mid y \mid \}$. Show that if $A$ and $B$ are re...
admin
298
views
admin
asked
Oct 12, 2019
Theory of Computation
michael-sipser
theory-of-computation
regular-language
proof
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
24
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register