Close
Close Window

CS4114 Formal Languages Spring 2021

Chapter 9 Models of Computation

Show Source |    | About   «  9.1. Models of Computation   ::   Contents   ::   9.3. Turing Machine Exercises  »

9.2. Turing Machine

9.2.1. A General Model of Computation

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

9.2.2. Interpreting Turing Machines

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

9.2.3. Turing-Decidable vs. Turing-Acceptable Languages

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

9.2.4. Making More Complicated Machines part 1

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

9.2.5. Making More Complicated Machines part 2

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

9.2.6. Making More Complicated Machines part 3

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

1 / 18 Settings
<<<>>>

In this slideshow, we will see how a copy machine processes input string 'ab'.
The following machine is a copy machine that can transform #w# into #w#w#:
(Note: w represents the input string ('ab' in this case).)

Created with Raphaël 2.1.2
$R$
$\#$
$R^{2}_{\#}$
$\sigma$
$L^{2}_{\#}$
$\sigma$
$R_{\#}$
$\overline{\#}$
$\#$
$>L_{\#}$
Proficient Saving... Error Saving
Server Error
Resubmit

   «  9.1. Models of Computation   ::   Contents   ::   9.3. Turing Machine Exercises  »

nsf
Close Window