Computer Science, asked by MK31, 7 months ago

Construct a Turing Machine for languages i) L = {2^4n 1^n 0^3n | n≥1}
ii) L= {a^n b^m c^(nm) | n,m≥1}​

Answers

Answered by singhasubham73
0

Answer:

I am weak in maths sorry bro

Similar questions