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
0
votes
0
answers
1
This question is from introduction to formal language and automata peter linz 5th edition
Hafeezullah
asked
in
Theory of Computation
6 days
ago
by
Hafeezullah
13
views
theory-of-computation
peter-linz-edition5
regular-language
finite-automata
0
votes
0
answers
2
Made easy Theory of Computation
Which of them are not regular- (a) L={a^m b^n | n>=2023, m<=2023} (b) L={a^n b^m c^l | n=2023, m>2023, l>m} according made easy (b) is the answer but can we do like this- Let L1= {a^n |n=2023} ... ) and so L2 is regular L=L1.L2 (regular lang are closed under concatenation) therefore L is regular.this makes option (b) regular is it right approach ?
Shreya2002
asked
in
Theory of Computation
Dec 2
by
Shreya2002
71
views
theory-of-computation
regular-language
closure-property
made-easy-test-series
0
votes
0
answers
3
Toc-Self Doubt
Can anyone explain what is the meaning of saying set of some languages is another language. Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which is set of languages . If i say L is regular Does it mean L1,l2,l3...Ln are regular.
vishnu777
asked
in
Theory of Computation
Nov 24
by
vishnu777
44
views
theory-of-computation
self-doubt
regular-language
1
vote
1
answer
4
Test-Series
Consider the following language over $\sum$ = {0, 1} L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4} How many sates will min-DFA accepting L will have?
Pranavpurkar
asked
in
Theory of Computation
Nov 11
by
Pranavpurkar
124
views
theory-of-computation
test-series
minimal-state-automata
regular-language
0
votes
0
answers
5
Cross product of dfa
The below question is from test series. In the below question I think option B will be correct and C will not be correct. (If the image is appearing too small and blur please open the image on new tab for proper visibility) Following is the counter example for option C. ... D1 x D2 i.e (q1, q2); q1 is final state of D1 and q2 is final state of D2. Is my justification correct?
Chaitanya Kale
asked
in
Theory of Computation
Nov 5
by
Chaitanya Kale
67
views
theory-of-computation
regular-language
0
votes
1
answer
6
Theory of Computation
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
moe12leb
asked
in
Theory of Computation
Nov 5
by
moe12leb
70
views
theory-of-computation
regular-language
finite-automata
0
votes
1
answer
7
regular expressions
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
moe12leb
asked
in
Theory of Computation
Nov 2
by
moe12leb
78
views
theory-of-computation
regular-language
0
votes
0
answers
8
Pumping Lemma
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =} How can I prove that L is not a regular language using pumping lemma and contradiction?
shallowfalcon
asked
in
Theory of Computation
Oct 17
by
shallowfalcon
53
views
theory-of-computation
pumping-lemma
regular-language
0
votes
2
answers
9
Identification of Regular Language | TOC | Practice Question | Unacademy Class
Which of the following is/are Regular? A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$ ... D] None R => Reverse Please describe your answer.
anupamsworld
asked
in
Theory of Computation
Aug 29
by
anupamsworld
210
views
theory-of-computation
regular-language
0
votes
0
answers
10
Best Open Video Playlist for Regular and Context-free Languages Topic | Theory of compuation
Please list out the best free available video playlist for Regular and Context-free Languages Topic from Theory of compuation as an answer here (only one playlist per answer). We'll then select the best ... are more likely to be selected as best. For the full list of selected videos please see here
makhdoom ghaya
asked
in
Others
Aug 18
by
makhdoom ghaya
34
views
missing-videos
free-videos
video-links
go-classroom
regular-language
context-free-language
0
votes
1
answer
11
Regular Expression
Identify whether the language is regular or not and plz justify the ans.
Karishma Datt
asked
in
Theory of Computation
Jul 17
by
Karishma Datt
132
views
theory-of-computation
regular-language
test-series
Page:
1
2
3
4
5
6
...
22
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 regular-language
Recent Blog Comments
please add GO Classes 2023 Computer Networks...
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...