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
#Toc #regularexpression
Srken
asked
in
Theory of Computation
Sep 4, 2022
138
views
0
votes
0
votes
How to convert (a+b)* into a minimal Dfa
theory-of-computation
regular-expression
finite-automata
Srken
asked
in
Theory of Computation
Sep 4, 2022
by
Srken
138
views
answer
comment
Follow
share this
share
2 Comments
by
Kabir5454
commented
Sep 4, 2022
reply
Follow
share this
Do you know some theory on How we can convert regular expression to dfa ?
1
1
by
Rajatagrawal
commented
Oct 7, 2022
reply
Follow
share this
If ∑ ={ a,b} , then it is none other than ∑* . which contains all the strings . Just need one state which is final and also initial state .
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
one state initial as final with self loop
Ratul Chatterjee
answered
Oct 6, 2022
by
Ratul Chatterjee
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
2
answers
1
iarnav
asked
in
Theory of Computation
Mar 14, 2019
589
views
#TOC What will be the minimal DFA of this regular language?
Given L = { 0*1 + 0 + 1* + 10*1} where + symbol is UNION and NOT positive closure. Please draw the Minimal DFA for this.
iarnav
asked
in
Theory of Computation
Mar 14, 2019
by
iarnav
589
views
finite-automata
regular-expression
regs
theory-of-computation
0
votes
0
votes
2
answers
2
Reshu $ingh
asked
in
Theory of Computation
Jan 31, 2019
360
views
#TOC #Examples
Give examples of: Countable Infinite Set Countable Finite Set Uncountable Finite Set Uncountable Infinite Set
Reshu $ingh
asked
in
Theory of Computation
Jan 31, 2019
by
Reshu $ingh
360
views
theory-of-computation
finite-automata
regular-expression
0
votes
0
votes
0
answers
3
Reshu $ingh
asked
in
Theory of Computation
Jan 30, 2019
231
views
#TOC #GeneralGuidance
I am new to the topic of TOC and finding it difficult to develop intuition for questions. Though,I am good with Mathematics and someone told TOC is mathematical concept. How should I study TOC specifically?
Reshu $ingh
asked
in
Theory of Computation
Jan 30, 2019
by
Reshu $ingh
231
views
theory-of-computation
finite-automata
regular-expression
decidability
3
votes
3
votes
1
answer
4
ashishgateashish
asked
in
Theory of Computation
Mar 13, 2018
886
views
#TOC Doubt - Regular expressions
Part A: Given : (b|ab*ab*)* How can it be interpreted as: 1.((b+ab*)ab*)* 2.(b+(ab*ab*))* 3.((b+a)b*ab*)* Part B: 1.What will be its NFA ? 2.Can we draw a direct MINIMAL DFA for such questions?
ashishgateashish
asked
in
Theory of Computation
Mar 13, 2018
by
ashishgateashish
886
views
regular-expression
finite-automata
theory-of-computation
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
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
@Aakash_Bhardwaj all the best bro . For your...
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
