Question

Let Σ be an alphabet and L ⊆ Σ

+ be a finite language. The language L
is said to be a uniform code if for every u, v ∈ L, |u| = |v|. Design a
Turing Machine to accept the a language if it is a uniform code. Then
(a) Write a general schema for such a Turing Machine, if |Σ| = k and
|L| = n.
(b) Using the idea developed in (a) part, write precise transitions when
Σ = {a, b, c} and |L| = 10.

Answer 1

Explanation:

jjsjsjsjsjjahshshdhhdhdhdhhdhdhdhdhdhdhhdhdhshshdhdhdhdhhdhdhdhdhjdhdhdhhd ydhshhdhshdhdhhdhdhdhdhdhhdhdhdhhdhdhdhhdhdhdhhdhdhhdhdhhdhdhdhdhdhshahahahahhshshshskskskskkskskkskskkskkskskkskskksjsjjsksksjjsjsjksksksjjsjsjsjsjjsjsjjsjsjsjjsjsjsjsjsjjsjsjsjssesesesesesrsrsrseseesseseseseseseseseseseseseexexexexexexexexxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxjxjxjjxjxuxhxyxhhxhxyxhjxjxuxu