ch1_2 - Sep 1 2010(Wednesday Chapter 1 Regular Languages 4...

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

View Full Document Right Arrow Icon
Sep. 1, 2010 (Wednesday) Chapter 1: Regular Languages 4 Design of Finite Automata Three steps to design a finite automaton M to recognize a language L . step 1: determine the information to remember about the part of an input string which M has already read. step 2: represent that information as a set of states. The start state is the state corresponding to the empty string. A final state is a state corresponding to strings in L . step 3: assign a transition for each input symbol from each state. Remark 1: If the information remembered in step 1 is insufficient, step 3 will have problems. Remark 2: The information needed to remember in step 1 may not be unique. Example 1 Design a finite automaton M 1 which recognizes the following language L 1 = { x over { 0,1 } | x does not end with 01 } SOLUTION 1 for Example 1: step 1: When M 1 is reading an input string, it should remember what are the last two input symbols that we just read? step 2:
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 note was uploaded on 09/30/2010 for the course CSE 434sd taught by Professor Csczdxc during the Spring '10 term at Harding.

Page1 / 3

ch1_2 - Sep 1 2010(Wednesday Chapter 1 Regular Languages 4...

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