Design a turing machine to accept the language 0^n 1^n 2^n

3.8kviews

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: Dec 2016

theory of computation

ADD COMMENT EDIT

1 Answer

181views

written 8.7 years ago by

teamques10 ★ 70k

A Turing Machine is a 6-tuple

M = (Q, ∑, I, q0, δ, F) where
1. Q - finite, non-empty set of states
2. ∑ - finite set of at least 2 symbols: the alphabet. ^ ∈ ∑
3. I - non-empty subset of ∑; ^ ∉ I; input alphabet
4. q0 - q0 …

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.