Search results

{w | w does not contain twice as many 0s as 1s over the alphabet {0, 1}}. Draw state diagram and give formal description.

Q1) {0^n^2|n>=1}the language consisting of all strings of 0s whose length is a square number. Give Implementation-level description. Q2)Give give formal description of the TM and draw state diagram. {a^i ,b^j,c^k| i + j = k, and i,j>=0,k>=1}. Some example words of the language are as follows: a...