Register

sub: Theory Of Computation Topic: regular exp. to DFA

• retagged by
482 views
0 votes
0 votes

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.

• retagged by
User Avatar

1 Answer

0 votes
0 votes
There is no shortcut for that based on your practice u can do that easily
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Tuhin Dutta asked Dec 4, 2017
578 views
DFA and Reg Exp
$ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $ Draw the DFA and also write the Reg exp for the above language.
$ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $Draw the DFA and also write the Reg exp for the above language.
User Avatar
0 votes
0 votes
1 answer
3
Ram Swaroop asked Dec 28, 2018
2,226 views
made easy theory of computation regular expression
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s? a. (b*abb*) (a+€) b. (b+ab)* (a+€) c. (b*abb*)*(a+€)+b* d. (b*ab*)*(a+€)+b*(a+€)
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s?a. (b*abb*) (a+€)b. (b+ab)* (a+€)c. (...
User Avatar
4 votes
4 votes
1 answer
4
Garrett McClure asked Oct 9, 2017
1,252 views
Computation Theory - Show that the family of regular languages is closed under tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }.How do I show that the family of regular languag...
User Avatar
Link Copied!