in Theory of Computation edited by
173 views
0 votes
0 votes
Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression.
in Theory of Computation edited by
by
173 views

1 comment

Yes we can. Draw DFA and minimize.

I am getting $(a+bd^*c)^*$
0
0

Please log in or register to answer this question.