|
|
| Page | 7/7 | | Date | 20.03.2022 | | Size | 0.89 Mb. | | #58472 |
| 11-turing-machineExample (Solution) - The move will be δ(q0, a) = δ(q1, A, R) which means it will go to state q1, replaced a by A and head will move to right as:
Example (Solution) - The move will be δ(q1, b) = δ(q2, B, R) which means it will go to state q2, replaced b by B and head will move to right as:
Example (Solution) - The move will be δ(q2, a) = δ(q3, A, R) which means it will go to state q3, replaced a by A and head will move to right as
- The move δ(q3, Δ) = (q4, Δ, S) which means it will go to state q4 which is the HALT state and HALT state is always an accept state for any TM.
Example (Solution) - The same TM can be represented by Transition Table:
Example (Solution) - The same TM can be represented by Transition Diagram:
- https://www.javatpoint.com/automata-turing-machine
- https://www.javatpoint.com/automata-basic-model-of-turing-machine
- https://www.javatpoint.com/language-accepted-by-turing-machine
- https://www.javatpoint.com/examples-of-turing-machine
Adding References - http://infolab.stanford.edu/%7Eullman/ialc/spr10/slides/tm1.pdf
- http://infolab.stanford.edu/%7Eullman/ialc/spr10/slides/tm2.pdf
- https://www.geeksforgeeks.org/turing-machine-in-toc/
- https://eecs.wsu.edu/~ananth/CptS317/Lectures/TuringMachines.pdf
Adding References - https://www.tutorialspoint.com/automata_theory/turing_machine_introduction.htm
- https://www.tutorialspoint.com/automata_theory/accepted_and_decided_language.htm
- https://www.cs.odu.edu/~toida/nerzic/390teched/tm/definitions.html
- https://www.cse.iitb.ac.in/~akshayss/lecture1.pdf
Email Email didihrizki@umm.ac.id (work) diedieh02@gmail.com (personal) Phone : 081349254787
Share with your friends: |
|
|
