Non deterministic Turing machine -

i new ndtm, understand concept of turing machine. when comes ndtm little confused, m supposed develop ndtm language {a,b,c} ,

l = {w ∈ Σ*| Ǝv ∈ Σ*, Ǝn >= 2 w = v (to power of) n } 

first thing want know how read l, example meaning of Ǝ. understand ndtm gives twp possibilities of 1 outcome, example a: have , without if correct, can me fugure out?

this should marked "homework" think.

Ǝ "there exists"
Σ "the set of symbols in language" ({a, b,c}) in case
∈ "element of"

now have that, can read language. l set of words w in {a, b, c}* such there exists word v , there exists n >= 2 such w repetition of v n times. e.g. ababab = (ab)^3 ∈ l.

now want come turing machine, m, represent language, have consider:

• when reject word (what our rejection state, on stack)
• when accept word (what our accepting state, on stack)
• how guarantee m terminates.

we can see a not in l because n >= 2 implies length of v^n @ least 2 (0 in case of empty string though, outlier). b , c. consideration , knowledge n >= 2, figure out words not accepted (e.g. consider b, abc, cab, cca, etc.).