Lec01DFA - COT 4210 Lecture 1, 1/12/05 Notetakers: Frank...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: COT 4210 Lecture 1, 1/12/05 Notetakers: Frank Cama & Enrique Montealegre input: 5 nickels 10 dimes 5 states: 0, 5, 10, 15, 20 ex1: initial state is 0 machine takes dime, state is now 10 machine takes dime, state is now 20 machine takes dime, output soda! State is now 5 Cost of soda was 30 ex2: initial state is 5 machine takes nickel, state is now 10 machine takes nickel, state is now 15 machine takes nickel, state is now 20 machine takes nickel, output soda! State is now 0 Cost of soda was 20 NOTE: double encircled state is the accepted state arrow on top left of diagram points to starting state input: 1, 0 states: Q 1 , Q 2 , Q 3 ex1: 111 Q 1 Q 1 Q 1 Q 1 (Accepted) ex2: 010 Q 1 Q 2 Q 2 Q 3 (Rejected) ex3: 10110 Q 1 Q 1 Q 2 Q 2 Q 2 Q 3 (Rejected) Note: ex2 and ex3 were rejected because they did not end in the accepting state. This machine describes a language, namely, it is the set of all strings that the DFA accepts....
View Full Document

Page1 / 4

Lec01DFA - COT 4210 Lecture 1, 1/12/05 Notetakers: Frank...

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

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