The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
26 views
What is the DFA for

L = { w1abw2 : w1 ∊ {a,b}* , w2 ∊ {a,b}* }
asked in Theory of Computation by (285 points) | 26 views
+1
The regex for this would be $(a+b)^*ab(a+b)^*$. You can the construct a NFA for this, and then convert the NFA to a DFA using the subset construction method.
0
and it will have #3 states DFA.

Please log in or register to answer this question.



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

40,903 questions
47,555 answers
146,266 comments
62,304 users