1 votes 1 votes Construct a Turing Machine for the language of all strings of this form $L= \{(a^m)(b^n) \mid {\text{n is a multiple of m, and m belongs to N}\}}$ Theory of Computation theory-of-computation turing-machine + – The Capricorn asked Apr 5, 2018 • edited Apr 7, 2018 by Subarna Das The Capricorn 217 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
