CODEWITHSUNDEEP
turing-machines
random-access
random-access

Reputation: 29

language for Turing machine, {w#w | w ∈ {0,1}*}

Recently, I am studying a computation theory and got a question regarding turning machine.

let {w#w | w ∈ {0,1}*} be the language of a turning machine. it will accept, for example, 01#01.

however, if we have a turning machine accepting the language of {w#w | w ∈ {0,1}}. What string will it accept?

Upvotes: 0

Views: 1848

Answers (1)

Mo B.
Mo B.

Reputation: 5827

In that case, w can only be 0 or 1, so the language is finite:

L = { 0#0, 1#1 }

Upvotes: 1

Related Questions