For some language 14 with E = 1a,b} and |Q| = 27, if I claimed that anLBA M can not decide input "abbba", how can you verify that the input does cause an infinite loop?
Added by Lauren H.
Step 1
An LBA is a type of Turing machine that operates within a limited amount of tape space, specifically bounded by the length of the input string. In this case, the input string is "abbba". Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 86 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let M be a Turing machine that is defined by: δ a b <> # q0 | q1,b,S | q1,a,S | q0,<>,R | q2,#,S q1 | q0,a,R | q0,b,R | q1,<>,R | q0,#,R q2 | - | - | - | - 1. Trace the computation of M starting from the configuration (q0,<> aaabbba). 2. Describe informally what M does when it starts from state q0 and the read-write head points to any cell on the tape.
Akash M.
Draw the state diagram of a Turing decider that recognizes the language {0^n 1^n 0^n 1^n where n >= 0}. Scanning from left to right, convert the first 0 to a blank, skip the rest of the 0's and then X's, and convert the first 1 to X, then skip the rest of the 1's and then the X's, and convert the first 0 to X, then skip the rest of the 0's and then X's, and convert the first 1 to X. Reject if this cannot be done. Otherwise, keep going left until reaching the blank and repeat the process. If no 0 is found after the blank, then continue scanning right, skipping all the X's until a 0, 1, or blank is encountered. If a 0 or 1 is encountered, reject it. If a blank is encountered, accept it. You only have to draw the state diagram (aka formal description) of the above algorithm (aka informal description).
A nondeterministic Turing machine M with start state q0 and accepting state qf has the following transition function: δ(q, a) | 0 | 1 | B q0 | {(q1, 0, R)} | {(q1, 0, R)} | {(q1, 0, R)} q1 | {(q1, 1, R), (q2, 0, L)} | {(q1, 1, R), (q2, 1, L)} | {(q1, 1, R), (q2, B, L)} q2 | {(qf, 0, R)} | {(q2, 1, L)} | {} qf | {} | {} | {} Simulate all sequences of 5 moves, starting from initial configuration q01010. q01010 → 0q1010 → 01q110 → 011q10 → 0111qf
Aarya B.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD