hwsol3 - Theory of Algorithms. Spring 2000. Homework 3...

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

View Full Document Right Arrow Icon
Theory of Algorithms. Spring 2000. Homework 3 Solutions. Section 2.2 (3) δ * ( q 0 ,a )= { q 0 ,q 1 ,q 2 } . δ * ( q 1 )= { q 0 ,q 1 ,q 2 } . (4) δ * ( q 0 , 1010) = { q 0 ,q 2 } . δ * ( q 1 , 00) = . (5) - - - ? 9 - a a a a b 9 b (8) - - b a ? b 6 - I λ ? a (9) 01001, 000 are accepted. (10) { λ } (11) - > j - - - - * + a a a a a a a a (12) { 0 2 n +1 | n 0 }∪{ w 10 2 n | w ∈{ 0 , 1 } * n 0 } . section 2.3 (1) { q 0 } { q 0 ,q 1 ,q 2 } - a - N a 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
(2) { q 0 } { q 1 ,q 2 } - - { q 0 ,q 2 } 0,1 - N 9 1 0,1 0 Using the procedure: 1 ) ? 0,1 0 1 Finding the dfa by thinking about the language: - (3) { q 0 } { q 0 ,q 1 ,q 2 } { q 1 ,q 2 } N 0 - : j 1 0 Using the procedure: R I 0 1 y 1 6 0,1 thinking about the language:
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

hwsol3 - Theory of Algorithms. Spring 2000. Homework 3...

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

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