0 votes 0 votes Show that there exists an algorithm that can determine for every regular language $L$, whether or not $|L| ≥ 5$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 10, 2019 Naveen Kumar 3 125 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.