Showing 0-0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Turing Machine Exercise: More a's Automata Construction Exercise User creates a Turing machine that recognizes the language with more a's than b's or c's. OpenDSA Turing Machine
2 Turing Machine Exercise: Reverse a String Automata Construction Exercise User creates a Turing machine that, given string W, outputs WW^R. OpenDSA Turing Machine
3 Turing Machine Exercise: Palindromes Automata Construction Exercise User creates a Turing machine that recognizes the language of palindromes on strings of a's and b's. OpenDSA Turing Machine
4 Turing Machine Exercise: Add an a Automata Construction Exercise User creates a Turing machine that adds an a to a string of a's. OpenDSA Turing Machine
5 Turing Machine Exercise: Accept Powers of 2 Automata Construction Exercise User creates a Turing machine that accepts strings of a's with the number of characters being a power of 2. OpenDSA Turing Machine
6 Turing Machine Exercise: Erase abc Automata Construction Exercise User creates a Turing machine that erases a string of a's, b's, and c's. OpenDSA Turing Machine
7 Turing Machine Exercise: Decide Powers of 2 Automata Construction Exercise User creates a Turing machine that decides if strings of a's have a length that is a power of 2. OpenDSA Turing Machine
8 Turing Machine Exercise: Keep abc Automata Construction Exercise User creates a Turing machine that moves over a string of a's, b's, and c's. OpenDSA Turing Machine
9 Turing Machine Exercise: Replace aba with aca Automata Construction Exercise User creates a Turing machine that replaces every substring aba with aca. OpenDSA Turing Machine
10 Turing Machine to Copy a String Algorithm Visualization, Code Tracing Presentation Slideshow presenting the execution of a Turing machine that copies a string. OpenDSA Turing Machine
11 Composition of Turing Machines Programmed Instruction Slideshow the formal conepts that support composition of Turing machines, which is a necessary step to building more complicated machines. OpenDSA Turing Machine
12 Turing Machines Deciding vs. Accepting Frameset Programmed Instruction Slideshow presenting the distinction between a Turing Machine that decides a language (always halts with a decision) vs. one that... OpenDSA Turing Machine
13 Turing Machine Extensions Frameset Presentation Slideshow presenting various potential extensions to Turing machines, such as two-dimensional tapes, multiple heads, and non-determinism. Includes proofs that these... OpenDSA Turing Machine
14 Visualizaiton of the Turing Machine that accepts a^n b^n c^n Algorithm Visualization, Code Tracing Presentation Detailed trace on some examples for a Turing machine that accepts the langugage a^n b^n c^n. OpenDSA Turing Machine
15 Turing Machines Introduction Frameset Programmed Instruction Slideshow introducing the concept of a Turing machine and its formal definition. OpenDSA Collision Resolution
16 Turing Machines Configurations and Terminology Frameset Programmed Instruction Slideshow presenting the concept of a configuration for a Turing machine, along with defintions for terms like halting, accepting, and... OpenDSA Collision Resolution