Design a tuning machine as an acceptor for the language {a^n b^m| n, m>=0 and m>=n}

11kviews

written 8.7 years ago by

teamques10 ★ 70k

• modified 3.8 years ago

Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 10M

Year: May 2016

theory of computation

ADD COMMENT EDIT

1 Answer

1.1kviews

written 8.7 years ago by

teamques10 ★ 70k

The turing machine will have a^n b^m on its tape initially.

Therefore, it will start with the leftmost a, go on scanning a’s, and moving right keeping them as it is, till it get B(blank), it replaces this b by a, and then again go on scanning a’s and moving …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.