0 votes 0 votes In the chain code language in Exercise 24, Section 3.1, let $L$ be the set of all $w ∈$ {$u,r,l,d$}$^*$ that describe rectangles. Show that $L$ is not a regular language. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 12, 2019 Naveen Kumar 3 161 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.