Ask
Login
0
7.9kviews
Design a Turing Machine which accepts all strings of the form 0n1n, n>=1
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 3.5 years ago
theory of computation
ADD COMMENT EDIT
1 Answer
0
486views
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k
  • 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 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.