Draw out a determinism Turing machine that computes a mapping reduction from L1 ≤ m L2 where L1 ＝ {w:w ∈ {a,b}* and |W| is even} and where L2 ＝ {anbn:n ≥ 0}.

Consider the following algorithm and generate a top down parser for it.STARTArrange non-terminals in some order like A1, A2, A3,…,Anfor each i from 1 to n{for each j from 1 to i-1{replace each production of form Ai ⟹Aj?with Ai ⟹ X1? | X2? | X3? |…| ?where Aj ⟹ X1 | X2|…| Xn are current Aj productions}}eliminate immediate left-recursionEND

Please give me correct solution.

Let SINGLETM = { | M is a TM and for all s e L(M), I5| = 1}. Show that SINGLETM is undecidable by reduction from Anm, the acceptance problem for Turing machines. Do not use Rice's Theorem.

Deterministic Finite Automata (DFA).Kindly solve correctly,will upvote you❤️

Correct answer will be upvoted else downvoted.   We will consider cells of a square network n×n as contiguous in the event that they have a typical side, that is, for cell (r,c) cells (r,c−1), (r,c+1), (r−1,c) and (r+1,c) are nearby it.    For a given number n, build a square lattice n×n to such an extent that:    Every integer from 1 to n2 happens in this network precisely once;    On the off chance that (r1,c1) and (r2,c2) are contiguous cells, the numbers written in them should not be neighboring.    Input    The principal line contains one integer t (1≤t≤100). Then, at that point, t experiments follow.    Each experiment is characterized by one integer n (1≤n≤100).    Output    For each experiment, output:    - 1, if the necessary network doesn't exist;    the necessary lattice, in any case (any such network if a significant number of them exist).

Let L = {M = (Q,E, r, 6, 9o: Gaccept Trejecet) : M is a Turing machine and 3q € Q s.t. q is a useless state} Is L decidable or undecidable? Prove it.

Consider the following language L over Σ = {0, 1, 2}:  L = { 0i2 1 2 02i1i | i ≥ 0 } 1. Construct a Turing machine accepting L. Justify your answer, explaining how the TM youconstructed will accept words in the language L. 2. Give an accepting run of your TM for the word 0212001 Hint: think about the TM accepting the language { 0i2 1 2 02i1i | i ≥ 0 } and how can it be changed to accept the language above. Notation: recall that e.g. we write 0i for the word consisting of i-many 0’s.

Please written by computer source Let x be a binary string. The minimal description of x, written d(x), is the shortest string ⟨M, w⟩ where TM M on input w halts with x on its tape. If several such strings exist, select the lexicographically first among them. The descriptive complexity, or Kolmogorov complexity, of x, written K(x), is K(x) = |d(x)|. Show that the function K(x) is not a computable function. HINTS: If K is a computable function, there is some TM which computes it. That TM can be used to find strings of large complexity. Try to design a program which outputs “complex” strings but which contradicts their supposed complexity, and even contradicting the supposed complexity of a single string suffices.

Is your language regular? If so, give a regular expression for the language. If not, demonstrate that the language is not regular using the Pumping Lemma for regular lan- guages.