chapterOnev2 - 1 1 0 0 0 0 1 Top four paths carry 0 1 0 1 0...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
1 1 0 0 0 1 0 1 0 1 1 1 1 0 0 0 0 1 1 1 Top four paths carry Bottom four Paths: no carry
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
1.31 simple proof by construction 0,1 Consider a language with any combination Of ones and zeros followed by two ones. 1 1 1 1 0,1 In language not in lang 1 11 110 It is regular, and you can construct The reverse of the language by building An FA that has two ones followed by Any combination of ones and zeros to Follow. 00000011 01010101011 11 011 111 1111 10101110 110 11110 10 10101 Reverse language W ®
Background image of page 2
Problem 1.31 continued example two Consider the language of zero , one pairs (every zero followed by a one) no Leading ones…. . (examples : 01,0101,010101,01010101) I can write an FA to represent this language: 0 1 1 0 Note: no sign is the ‘empty string’
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 7

chapterOnev2 - 1 1 0 0 0 0 1 Top four paths carry 0 1 0 1 0...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online