Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 A = {w#w | w in {0,1}*}

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 A = {w#w | w in {0,1}*}"— Presentation transcript:

1 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 A = {w#w | w in {0,1}*}

2 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R Σ = {0,1,#} Γ = {0,1,#,x,_}

3 Example 1 s = #

4 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = # ____#_____

5 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = # ____#_____

6 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = # ____#_____

7 Example 2 s = 0#

8 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 0# ___0#_____

9 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 0# ___x#_____

10 1 1 2 2 3 3 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 0# ___x#_____

11 Example 3 s = 01#0

12 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#0 ___01#0___

13 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R ___x1#0___ s = 01#0

14 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R ___x1#0___ s = 01#0

15 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R ___x1#0___ s = 01#0

16 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R ___x1#x___ s = 01#0

17 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R ___x1#x___ s = 01#0

18 Example 3 s = 01#01

19 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___01#01__

20 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#01__

21 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#01__

22 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#01__

23 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#x1__

24 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#x1__

25 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#x1__

26 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#x1__

27 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#x1__

28 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___x1#x1__

29 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#x1__

30 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#x1__

31 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#x1__

32 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#xx__

33 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#xx__

34 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#xx__

35 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#xx__

36 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#xx__

37 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#xx__

38 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#xx__

39 1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 1  x,R 0,1  R #R#R xRxR 1  x,L 0,1,x  L #L#L 0,1  L xRxR 0  x,R xRxR 0,1  R 0  x,R xRxR _R_R #R#R #R#R s = 01#01 ___xx#xx__

40 Finding a symbol “-” Move until you hit _ q q xRxR _R_R

41 Branch inside of a loop 1 1 2 2 3 3 accept 6 6 7 7 1  x,R 0  x,R ?R?R

42 Expanding the Tape Alphabet Σ = {0,1,#} Γ = {0,1,#,x,0,1,#,x,_}

Download ppt "1 1 2 2 3 3 4 4 8 8 accept 5 5 6 6 7 7 A = {w#w | w in {0,1}*}"

Similar presentations

Find the prime factors of 18.

Find the prime factors of 18.
2-6-5. Square Roots When working a square root problem, ask: “What times itself is the number inside the root symbol?” because 3 times 3 is 9 because.

Square Roots When working a square root problem, ask: “What times itself is the number inside the root symbol?” because 3 times 3 is 9 because.
ABC Book by student/teacher name

ABC Book by student/teacher name
CS 490: Automata and Language Theory Daniel Firpo Spring 2003.

CS 490: Automata and Language Theory Daniel Firpo Spring 2003.
CS5371 Theory of Computation Lecture 10: Computability Theory I (Turing Machine)

CS5371 Theory of Computation Lecture 10: Computability Theory I (Turing Machine)
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong DFA minimization.

CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong DFA minimization.
MULTIPLES OF 2 By Preston, Lincoln and Blake. 2 X 1 =2 XX 2X1=2 1+1=2.

MULTIPLES OF 2 By Preston, Lincoln and Blake. 2 X 1 =2 XX 2X1=2 1+1=2.
Exponents 3² Mrs. 3 × Mrs. 3 3 × 3 3².

Exponents 3² Mrs. 3 × Mrs. 3 3 × 3 3².
GREATEST COMMON FACTOR

GREATEST COMMON FACTOR
Prime Factors. What are they? All composite numbers can be written as the product of prime numbers. This product is known as the prime factorisation of.

Prime Factors. What are they? All composite numbers can be written as the product of prime numbers. This product is known as the prime factorisation of.
Chapter 61 More about Loop Do ….. Loop Write Down “Do” and “Loop”

Chapter 61 More about Loop Do ….. Loop Write Down “Do” and “Loop”
Ch 8: Exponents A) Product & Power Properties Objective: To recognize the properties of exponents and use them to simplify expressions.

Ch 8: Exponents A) Product & Power Properties Objective: To recognize the properties of exponents and use them to simplify expressions.
Lesson #3- Exponent Laws

Lesson #3- Exponent Laws
P ROPERTIES OF E XPONENTS. P RE -T EST Q UESTION 1 y 3 y 4 A.) y 12 B.) y 7 C.) y -1 D.) y.

P ROPERTIES OF E XPONENTS. P RE -T EST Q UESTION 1 y 3 y 4 A.) y 12 B.) y 7 C.) y -1 D.) y.
Review for Quarter 1 Test 1 I. Base Ten Place-Value System II. Exponents III. Order of Operations IV. Expanded Notation.

Review for Quarter 1 Test 1 I. Base Ten Place-Value System II. Exponents III. Order of Operations IV. Expanded Notation.
Инвестиционный паспорт Муниципального образования «Целинский район»

Инвестиционный паспорт Муниципального образования «Целинский район»
Name Collection Boxes Standard 2.1: Numbers, Number Systems and Number Relationships C. Represent equivalent forms of the same number through the use of.

Name Collection Boxes Standard 2.1: Numbers, Number Systems and Number Relationships C. Represent equivalent forms of the same number through the use of.
(x – 8) (x + 8) = 0 x – 8 = 0 x + 8 = 0 + 8 - 8 x = 8 x = - 8 10 7 52 (x + 5) (x + 2) = 0 x + 5 = 0 x + 2 = 0 - 5 - 2 x = - 5 x = - 2.

(x – 8) (x + 8) = 0 x – 8 = 0 x + 8 = x = 8 x = (x + 5) (x + 2) = 0 x + 5 = 0 x + 2 = x = - 5 x = - 2.
11.4 Multiply and Divide Rational Expressions. SIMPLIFYING RATIONAL EXPRESSIONS Step 1: Factor numerator and denominator “when in doubt, write it out!!”

11.4 Multiply and Divide Rational Expressions. SIMPLIFYING RATIONAL EXPRESSIONS Step 1: Factor numerator and denominator “when in doubt, write it out!!”
Prime Factorization Notes 9/8/10 Composite Number- a whole number greater than 1 with more than two factors. Prime Number – A whole number with exactly.

Prime Factorization Notes 9/8/10 Composite Number- a whole number greater than 1 with more than two factors. Prime Number – A whole number with exactly.

Similar presentations

Ads by Google