Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regs
0
votes
2
answers
1
#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.
Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.
iarnav
933
views
iarnav
asked
Mar 14, 2019
Theory of Computation
finite-automata
regular-expression
regs
theory-of-computation
+
–
2
votes
1
answer
2
What will be the R.E of this DFA
I'm getting (a+ba*b)*a*b
I'm getting (a+ba*b)*a*b
iarnav
795
views
iarnav
asked
Aug 16, 2017
Theory of Computation
finite-automata
regs
regular-expression
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register