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
DFA to Regular Expression
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
May 10, 2023
423
views
0
votes
0
votes
theory-of-computation
regular-expression
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
May 10, 2023
by
Çșȇ ʛấẗẻ
423
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
1
vote
1
vote
.
artim
answered
May 10, 2023
by
artim
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
1
vote
1
vote
2
answers
1
Shaina Singh
asked
in
Theory of Computation
Jul 30, 2023
792
views
Convert given DFA to regular expression, I think it's just that 2 is dead state and thus can be eliminated.
Shaina Singh
asked
in
Theory of Computation
Jul 30, 2023
by
Shaina Singh
792
views
theory-of-computation
number-of-dfa
regular-expression
0
votes
0
votes
1
answer
2
Swapnil Naik
asked
in
Theory of Computation
Oct 24, 2018
838
views
Dfa to regular expression
I tried applying a method where we write equation as state with incoming transition on given dfa - q1 = $\epsilon$ + bq1+bq2 q2 = aq1+aq2 but then able to reach till this conclusion only: q2 = ab*+aq2+abq2b* How to solve further? Here q1 is a start state.
Swapnil Naik
asked
in
Theory of Computation
Oct 24, 2018
by
Swapnil Naik
838
views
theory-of-computation
regular-expression
0
votes
0
votes
1
answer
3
Shubhanshu
asked
in
Theory of Computation
Jul 1, 2017
3,097
views
DFA to Regular Expression
Consider the given dfa What is the regular expression of the given dfa? I am getting :- a(ba)*bb + a(ba)*a + bb Is it correct or not?
Shubhanshu
asked
in
Theory of Computation
Jul 1, 2017
by
Shubhanshu
3.1k
views
theory-of-computation
finite-automata
regular-expression
1
vote
1
vote
2
answers
4
vishal8492
asked
in
Theory of Computation
Dec 6, 2016
909
views
Regular Expression to DFA
Having hard time , to understand why (A) isn't the answer ? Looking at DFA it looks , 2* is good starting state ; then there are two paths 0 first path good enough ; for second path 1 is necessary what about 2 ; shouldn't it be 2* as it's 0 or more occurences. Am I solving it wrong ? Is this incorrect approach to look at the question ?
vishal8492
asked
in
Theory of Computation
Dec 6, 2016
by
vishal8492
909
views
theory-of-computation
regular-expression
regular-language
finite-automata
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 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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy