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
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.
GO Classes
asked
in
Theory of Computation
Jun 9, 2022
by
GO Classes
450
views
goclasses2024-toc-1-weekly-quiz
goclasses
theory-of-computation
regular-language
multiple-selects
2-marks
1
vote
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
sachin_27
asked
in
Theory of Computation
Jun 1, 2022
by
sachin_27
1.3k
views
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
lalitver10
asked
in
Theory of Computation
Feb 16, 2022
by
lalitver10
2.5k
views
theory-of-computation
regular-language
finite-automata
1
vote
1
answer
94
regular languages - TOC
Which of the following languages is/are regular?
atulcse
asked
in
Theory of Computation
Jan 28, 2022
by
atulcse
496
views
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 ?
jiminpark
asked
in
Theory of Computation
Dec 29, 2021
by
jiminpark
365
views
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)*
coder97
asked
in
Theory of Computation
Oct 5, 2021
by
coder97
681
views
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
Ash666
asked
in
Theory of Computation
Sep 12, 2021
by
Ash666
1.3k
views
theory-of-computation
regular-expression
regular-language
regular-grammar
1
vote
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.
soujanyareddy13
asked
in
Theory of Computation
May 10, 2021
by
soujanyareddy13
516
views
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$
Arjun
asked
in
Theory of Computation
Feb 18, 2021
by
Arjun
9.2k
views
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
Arjun
asked
in
Theory of Computation
Feb 18, 2021
by
Arjun
11.9k
views
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
go_editor
asked
in
Theory of Computation
Nov 20, 2020
by
go_editor
1.6k
views
ugcnetcse-oct2020-paper2
theory-of-computation
regular-language
1
vote
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
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
1.7k
views
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
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
875
views
nielit2016mar-scientistb
theory-of-computation
regular-language
1
vote
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.
admin
asked
in
Theory of Computation
Mar 31, 2020
by
admin
788
views
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
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
1.3k
views
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
1
vote
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}$
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
1.5k
views
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
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
2.6k
views
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 Ⅱ
Arjun
asked
in
Theory of Computation
Feb 12, 2020
by
Arjun
13.4k
views
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 _________
Arjun
asked
in
Theory of Computation
Feb 12, 2020
by
Arjun
13.4k
views
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
Satbir
asked
in
Theory of Computation
Jan 13, 2020
by
Satbir
2.1k
views
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?
admin
asked
in
Theory of Computation
Oct 19, 2019
by
admin
187
views
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.
admin
asked
in
Theory of Computation
Oct 12, 2019
by
admin
281
views
michael-sipser
theory-of-computation
regular-language
proof
2
votes
3
answers
113
CMI2019-A-1
Let $L_{1}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m\geq n\}$ and $L_{2}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m < n\}.$ The language $L_{1}\cup L_{2}$ is: regular, but not context-free context-free, but not regular both regular and context-free neither regular nor context-free
gatecse
asked
in
Theory of Computation
Sep 13, 2019
by
gatecse
871
views
cmi2019
regular-language
context-free-language
closure-property
3
votes
3
answers
114
CMI2019-B-1
Consider an alphabet $\Sigma=\{a,b\}.$ Let $L_{1}$ be the language given by the regular expression $(a+b)^{\ast}bb(a+b)^{\ast}$ and let $L_{2}$ be the language $baa^{\ast}b.$ Define $L:=\{u\in\Sigma^{\ast}\mid \exists w\in L_{2}\: s.t.\: uw\in L_{1}\}.$ Give an example of a word in $L.$ Give an example of a word not in $L.$ Construct an NFA for $L.$
gatecse
asked
in
Theory of Computation
Sep 13, 2019
by
gatecse
1.6k
views
cmi2019
regular-expression
regular-language
finite-automata
Page:
« prev
1
2
3
4
5
6
7
8
9
...
24
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 regular-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:...