Question

Construct an non deterministic Turing Machine which accepts the language { bⁿ a^m: n≥1, m ≥1}, i.e., the language of all strings over {b,a}, in which there is at least one b and one a and all b’s precede all a’s.