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 and Reg Exp
Tuhin Dutta
asked
in
Theory of Computation
Dec 4, 2017
583
views
0
votes
0
votes
$ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $
Draw the DFA and also write the Reg exp for the above language.
regular-expression
finite-automata
theory-of-computation
Tuhin Dutta
asked
in
Theory of Computation
Dec 4, 2017
by
Tuhin Dutta
583
views
answer
comment
Follow
share this
share
4 Comments
Show 7 previous comments
by
joshi_nitish
commented
Dec 4, 2017
reply
Follow
share this
ohh, yes. its 7.....silly mistake :(
0
0
by
Ashwin Kulkarni
commented
Dec 4, 2017
reply
Follow
share this
@Pawan Kumar we can't write that way because that expression is accepting "ab" also which is not in the language.
1
1
by
Pawan Kumar 2
commented
Dec 4, 2017
reply
Follow
share this
oh yes....thanks
:)
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
0
answers
1
Tuhin Dutta
asked
in
Theory of Computation
Dec 4, 2017
453
views
Simple doubt in Reg Exp of TOC
why $bb^*$ is $b^*$ and not $b^+$? Ref: $a^*(bb^*a + a)a^*\\=a^*(bb^*+\epsilon)aa^*\\=a^*b^*aa^*\\=a^*b^*a^*a$
Tuhin Dutta
asked
in
Theory of Computation
Dec 4, 2017
by
Tuhin Dutta
453
views
theory-of-computation
regular-expression
finite-automata
0
votes
0
votes
1
answer
2
Ronak520
asked
in
Theory of Computation
Apr 1, 2017
479
views
sub: Theory Of Computation Topic: regular exp. to DFA
To Convert regular expression to DFA -> In most of the RE we can not directly convert it to DFA we have to first converting it to NFA-null then NFA-without null and then DFA and that takes too much time to me plz tell me any short cut to do this if any else conform me this is the only way.
Ronak520
asked
in
Theory of Computation
Apr 1, 2017
by
Ronak520
479
views
regular-expression
finite-automata
theory-of-computation
1
vote
1
vote
1
answer
3
Tuhin Dutta
asked
in
Theory of Computation
Dec 4, 2017
2,272
views
Reverse and Complement of a Reg lang represented by DFA
A regular lang is represented by a DFA. To find the reverse of the lang, we do the following: Change directions of arrows of state transitions and also interchange final <-> non-final states. A regular lang is ... reversing. So if there were two final states before then after reversing should both the states be "start state"?
Tuhin Dutta
asked
in
Theory of Computation
Dec 4, 2017
by
Tuhin Dutta
2.3k
views
theory-of-computation
finite-automata
0
votes
0
votes
0
answers
4
doaa
asked
in
Theory of Computation
May 13, 2018
443
views
what is the regular expression and design dfa and nfa for arthimatic expression
doaa
asked
in
Theory of Computation
May 13, 2018
by
doaa
443
views
finite-automata
theory-of-computation
regular-expression
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
