0 votes 0 votes Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression. Theory of Computation theory-of-computation finite-automata regular-expression + – nbhatt asked Sep 21, 2022 • edited Sep 21, 2022 by nbhatt nbhatt 373 views answer comment Share Follow See 1 comment See all 1 1 comment reply Sumit Singh Dhami commented Sep 21, 2022 reply Follow Share Yes we can. Draw DFA and minimize. I am getting $(a+bd^*c)^*$ 0 votes 0 votes Please log in or register to add a comment.
