and 4 others joined a min ago.
0
2.4kviews
Explain Turing Machines
1 Answer
0
6views
written 7.9 years ago by
teamques10
★ 70k
|
A Turing Machine has a 6-tuple representation as given below
M = (Q, ∑, I, q0, δ, F) where
Q - finite, non-empty set of states
∑ - finite set of at least 2 symbols: the alphabet. ^ ∈ ∑
I - non-empty subset of ∑; ^ ∉ I; input …
and 5 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.