New About Yours API Help
180 bytes, Plain text
1
2
3
4
5
Let L be any regular language over an alphabet Σ. Using L, we define

chop(L) = {w : ∃ x, y, z ∈ Σ∗ , xyz ∈ L, w = xz}.

Show that chop(L) is regular or give a counter-example.
Pasted 9 months, 1 week ago — Expires in 88 days
URL: http://dpaste.com/2QA0Z79