Download presentation

Presentation is loading. Please wait.

Published byMaryam Marple Modified over 3 years ago

1
1 If we modify the machine for the language we can easily construct a machine for the language Observation

2
Turing machine for the language

3
Step 0 # a b c #

4
Step 1 # a b c #

5
Step 2 # x b c #

6
Step 3 # x y c #

7
Step 4 # x y z #

8
Step 5 # x y z #

9
Step 6 # x y z #

10
Step 7 # x y z #

11
Step 8 # x y z #

12
Step 9 # x y z #

13
Step 10 # x y z #

14
Step 0 # a a b b c c #

15
Step 6 # x a y b z c #

16
Step 10 # x a y b z c #

17
Step 11 # x a y b z c #

18
Step 16 # x x y y z z #

19
Step 20 # x x y y z z #

20
Step 25 # x x y y z z #

Similar presentations

OK

1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?

1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on brushless dc motor Ppt on job rotation advantages Ppt on history of olympics Ppt on automobile related topics for peace Ppt on covering the environmental problems causes effects and solutions Doc to ppt online converter free Ppt on financial system and economic development Ppt online mobile shopping Ppt on energy giving food Ppt on product marketing