TM M = (Q, E, I, 8, 90, 9a, gr), where Q = {90, 91, 92, 9a, ¶r}, Σ = {0, 1}, T = {0, 1, L}, and 8 is: 8(90, L) = (gr, U, R) 8(90,0) = (91, 0, R) 8(90, 1) = (go, 1, R) 8(q1, L) = (ga, L, R) 8(91,0) = (9₁, 0, R) 8(91, 1) = (92, 1, R) 8(92, L) = (92, U, R) 8(92,0) = (90, 0, R) 8(92, 1) = (92, 1, R) i. Prove that M is NOT a decider. ii. Mathematically describe the language A that M recognises. Prove that A CL(M). iii. Prove A = L(M). iv. Is A Turing-decidable? [Give clear reasons for your answer. No need for a formal proof.]

TM M = (Q, E, I, 8, 90, 9a, gr), where Q = {90, 91, 92, 9a, ¶r}, Σ = {0, 1}, T = {0, 1, L}, and 8 is: 8(90, L) = (gr, U, R) 8(90,0) = (91, 0, R) 8(90, 1) = (go, 1, R) 8(q1, L) = (ga, L, R) 8(91,0) = (9₁, 0, R) 8(91, 1) = (92, 1, R) 8(92, L) = (92, U, R) 8(92,0) = (90, 0, R) 8(92, 1) = (92, 1, R) i. Prove that M is NOT a decider. ii. Mathematically describe the language A that M recognises. Prove that A CL(M). iii. Prove A = L(M). iv. Is A Turing-decidable? [Give clear reasons for your answer. No need for a formal proof.]

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section: Chapter Questions

Problem 4PP

See similar textbooks