a) Assume L is a decidable language over the alphabet . Let M be a Turing machine

a) Assume L is a decidable language over the alphabet Σ∗. Let M be a Turing machine that decides L, and let s1, s2, . . . , sk, . . .be a lexicographical ordering of the strings in Σ∗. Describe an enumerator that prints the strings in L in lexicographical order.

b) Assume there exists an enumerator E for L that prints the strings in lexicographical order. Write a decider for L. You may assume L is infinite. You can use pseudo-code for your decider.

c) Would your decider still work if L is a finite language? Explain

Answer rating: 100% (QA)

a decidable language let L be D be a decidee of Lo we would E that D to construct an he string of Li... View the full answer