0 votes 0 votes Suppose $L$ is a regular language with alphabet $\sum.$ Give an algorithm to tell whether $L=\sum^{*},i.e,$ all strings over it's alphabet. Theory of Computation ullman theory-of-computation regular-language descriptive + – admin asked Apr 6, 2019 admin 290 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.