1 / 80

Finite State Machines

Finite State Machines. Chapter 5. Languages and Machines. Regular Languages. Regular Language. L. Regular Expression. Accepts. Finite State Machine. Finite State Machines. An FSM to accept $.50 in change:. Definition of a DFSM. M = ( K ,  ,  , s , A ), where:

dale
Download Presentation

Finite State Machines

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Finite State Machines Chapter 5

  2. Languages and Machines

  3. Regular Languages Regular Language L Regular Expression Accepts Finite State Machine

  4. Finite State Machines An FSM to accept $.50 in change:

  5. Definition of a DFSM M = (K, , , s, A), where: K is a finite set of states  is an alphabet sK is the initial state AK is the set of accepting states, and  is the transition function from (K) to K

  6. Accepting by a DFSM Informally, M accepts a string w iff M winds up in some element of A when it has finished reading w. The language accepted by M, denoted L(M), is the set of all strings accepted by M.

  7. Configurations of DFSMs A configuration of a DFSM M is an element of: K* It captures the two things that can make a difference to M’s future behavior: • its current state • the input that is still left to read. The initial configuration of a DFSM M, on input w, is: (sM, w)

  8. The Yields Relations The yields-in-one-step relation |-M: (q, w) |-M (q', w') iff • w = aw' for some symbol a, and •  (q, a) = q' |-M * is the reflexive, transitive closure of |-M.

  9. Computations Using FSMs A computation by M is a finite sequence of configurations C0, C1, …, Cn for some n 0 such that: • C0 is an initial configuration, • Cn is of the form (q, ), for some state qKM, • C0 |-MC1 |-MC2 |-M … |-MCn.

  10. Accepting and Rejecting A DFSM Maccepts a string w iff: (s, w) |-M * (q, ), for some qA. A DFSM Mrejects a string w iff: (s, w) |-M* (q, ), for some qAM. The language accepted byM, denoted L(M), is the set of all strings accepted by M. Theorem: Every DFSM M, on input s, halts in |s| steps.

  11. An Example Computation An FSM to accept odd integers: even odd even q0q1 odd On input 235, the configurations are: (q0, 235) |-M (q0, 35) |-M |-M Thus (q0, 235) |-M* (q1, )

  12. Regular Languages A language is regular iff it is accepted by some FSM.

  13. A Very Simple Example L = {w {a, b}* : every a is immediately followed by a b}.

  14. A Very Simple Example L = {w {a, b}* : every a is immediately followed by a b}.

  15. Parity Checking L = {w {0, 1}* : w has odd parity}.

  16. Parity Checking L = {w {0, 1}* : w has odd parity}.

  17. No More Than One b L = {w {a, b}* : every a region in w is of even length}.

  18. No More Than One b L = {w {a, b}* : every a region in w is of even length}.

  19. Checking Consecutive Characters L = {w {a, b}* : no two consecutive characters are the same}.

  20. Checking Consecutive Characters L = {w {a, b}* : no two consecutive characters are the same}.

  21. Dead States L = {w {a, b}* : every a region in w is of even length}

  22. Dead States L = {w {a, b}* : every a region in w is of even length}

  23. Dead States L = {w {a, b}* : every b in w is surrounded by a’s}

  24. The Language of Floating Point Numbers is Regular Example strings: +3.0, 3.0, 0.3E1, 0.3E+1, -0.3E+1, -3E8 The language is accepted by the DFSM:

  25. A Simple Communication Protocol

  26. Controlling a Soccer-Playing Robot

  27. A Simple Controller

  28. Programming FSMs Cluster strings that share a “future”. Let L = {w {a, b}* : w contains an even number of a’s and an odd number of b’s}

  29. Even a’s Odd b’s

  30. Vowels in Alphabetical Order L = {w {a - z}* : all five vowels, a, e, i, o, and u, occur in w in alphabetical order}.

  31. Vowels in Alphabetical Order L = {w {a - z}* : all five vowels, a, e, i, o, and u, occur in w in alphabetical order}.

  32. Programming FSMs L = {w {a, b}* : w does not contain the substring aab}.

  33. Programming FSMs L = {w {a, b}* : w does not contain the substring aab}. Start with a machine for L: How must it be changed?

  34. A Building Security System L = {event sequences such that the alarm should sound}

  35. FSMs Predate Computers The Prague Orloj, originally built in 1410.

  36. The Abacus

  37. The Jacquard Loom Invented in 1801.

  38. Finite State Representations in Software Engineering A high-level state chart model of a digital watch.

  39. Making the Model Hierarchical

  40. The Missing Letter Language Let  = {a, b, c, d}. Let LMissing= {w : there is a symbol ai not appearing in w}. Try to make a DFSM for LMissing:

  41. Definition of an NDFSM • M = (K, , , s, A), where: • K is a finite set of states •  is an alphabet • sK is the initial state • AK is the set of accepting states, and  is the transition relation. It is a finite subset of • (K ( {})) K

  42. Accepting by an NDFSM M accepts a string w iff there exists some path along which w drives M to some element of A. The language accepted by M, denoted L(M), is the set of all strings accepted by M.

  43. Sources of Nondeterminism

  44. Analyzing Nondeterministic FSMs Two approaches: • Explore a search tree: • Follow all paths in parallel

  45. Optional Substrings L = {w {a, b}* : w is made up of an optional a followed by aa followed by zero or more b’s}.

  46. Multiple Sublanguages L = {w {a, b}* : w = aba or |w| is even}.

  47. The Missing Letter Language Let  = {a, b, c, d}. Let LMissing= {w : there is a symbol ai not appearing in w}

  48. The Missing Letter Language

  49. Pattern Matching L = {w {a, b, c}* : x, y {a, b, c}* (w = xabcabby)}. A DFSM:

  50. Pattern Matching L = {w {a, b, c}* : x, y {a, b, c}* (w = xabcabby)}. An NDFSM:

More Related