CENG304Homework2

CENG304Homework2 - Fatih University Department of Computer...

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

View Full Document Right Arrow Icon
Fatih University Department of Computer Engineering CENG 304 Automata Theory and Formal  Languages Assignment 2 Ahmet Faruk Bişkinler, 07010441 26 March 2007
Background image of page 1

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

View Full DocumentRight Arrow Icon
http://www.biskinler.com http://ahmet.piskinler.com/ 2.2.6. Design an nfa with no more than five states for the set  { abab n n    0}   {  aba n n    0}. 2.2.10. Find an nfa with four states for  L  = {  a n n    0}   {  b n a n    1}. 2.3.2. Convert the nfa in Exercize 11, Section 2.2 into an equivalent dfa. Answer: 0 1 q 0 {q 1 ,q 2 } {q 1 ,q 2 } q 1 {q 0 ,q 2 } {q 1 ,q 2 } q 2 Ø {q 1 ,q 2 } 2
Background image of page 2
2.3.3. Convert the following nfa into an equivalent dfa. Answer: 0 1 q 0 {q 0 ,q 1 ,q 2 } {q 1 ,q 2 } q 1 {q 0 ,q 1 ,q 2 } {q 1 ,q 2 } q 2 {q 2 } {q 1 } 3
Background image of page 3

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

View Full DocumentRight Arrow Icon
2.3.7. Prove that for every NFA with an arbitrary number of final states, there is an equivalent NFA 
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

CENG304Homework2 - Fatih University Department of Computer...

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

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