0 votes 0 votes Exhibit an algorithm that, given any regular language $L$, determines whether or not $L =L^*$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 10, 2019 Naveen Kumar 3 155 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.