lec0413 - Deterministic Finite Automata (a specific finite...

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

View Full Document Right Arrow Icon
Deterministic Finite Automata (a specific finite state machine) We have already talked about one way to specify a regular language: through a regular expression. Now, I will show you another way, using a more “visual” representation. In the textbook, they talk about finite state machines in sections 6.2 and 6.3. DFA’s are a specific type of finite state machine. In particular, a DFA does not have output, as a general FSM does. That is pretty much the only difference. Both in the book and in Dr. Lang’s notes(around 4-10 through 4-16) there is a formal definition of a DFA and FSM respectively. Since we have so little time to deal with these, I won’t get into the formal definition, which usually confuses people. If you are interested in it, look at Dr. Lang’s notes. I think they do a good job of explaining the mechanics of the definition. I will draw a whole bunch of pictures, and give you a basic idea of how one works. In the next class, I will show you why these are equivalent to regular expressions. The basic idea behind a DFA is this: Its goal is to read in a
Background image of page 1

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

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

This document was uploaded on 07/14/2011.

Page1 / 4

lec0413 - Deterministic Finite Automata (a specific finite...

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