SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Deterministic Finite Automata

apria avatar
apria
61 diapositives · 892 Views · Jul 15, 2014

Deterministic Finite Automata. DFA. A primitive computing machine with very limited amount of memory. Example (inspired from Sipser’s book): Automatic door mechanism :. DOOR. Front pad. Rear pad. Example. DOOR. Front pad. Rear pad. FRONT REAR BOTH. NEITHER. FRONT REAR

#deterministic finite automata #deterministic finite automata ppt #powerpoint #presentation
Deterministic Finite Automata - slide 1
01 / 61Deterministic Finite Automata
1 / 17

Télécharger la présentation

Deterministic Finite Automata
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Deterministic Finite Automata

  2. DFA • A primitive computing machine with very limited amount of memory. • Example (inspired from Sipser’s book): Automatic door mechanism: DOOR Front pad Rear pad

  3. Example DOOR Front pad Rear pad FRONT REAR BOTH NEITHER FRONT REAR BOTH CLOSED OPEN NEITHER

  4. Front pad Rear pad FRONT REAR BOTH NEITHER FRONT REAR BOTH CLOSED OPEN NEITHER

  5. Front pad Rear pad FRONT REAR BOTH NEITHER FRONT REAR BOTH CLOSED OPEN NEITHER

  6. DOOR Front pad Rear pad FRONT REAR BOTH NEITHER FRONT REAR BOTH CLOSED OPEN NEITHER

  7. Front pad Rear pad FRONT REAR BOTH NEITHER FRONT REAR BOTH CLOSED OPEN NEITHER

  8. Front pad Rear pad FRONT REAR BOTH NEITHER FRONT REAR BOTH CLOSED OPEN NEITHER

  9. Front pad Rear pad FRONT REAR BOTH NEITHER FRONT REAR BOTH CLOSED OPEN NEITHER

  10. DOOR Front pad Rear pad FRONT REAR BOTH NEITHER FRONT REAR BOTH CLOSED OPEN NEITHER

  11. DFA D F A INPUT TAPE ACCEPT or REJECT

  12. DFA parts a b b q0 q1 q2 q3 a a a b b q4 a b TRANSITION GRAPH

  13. DFA parts a b b q0 q1 q2 q3 a a a b b q4 a b STATES : {q0 , q1, q2, q3, q4}

  14. DFA parts a b b q0 q1 q2 q3 ACCEPTING STATE a a a b b q4 a b

  15. DFA parts NON-ACCEPTING STATE a b b q0 q1 q2 q3 a a a b b q4 a b

  16. DFA parts a b b q0 q1 q2 q3 START STATE a a a b b q4 a b

  17. DFA parts ALPHABET: Σ = {a,b} a b b q0 q1 q2 q3 a a a b b q4 a b

  18. DFA parts ALPHABET: Σ = {a,b} a b b q0 q1 q2 q3 a a a b b TRANSITION q4 a b

  19. DFA parts ALPHABET: Σ = {a,b} a b b q0 q1 q2 q3 a a a b b q4 a b Exactlyone transition from every state under each symbol in the alphabet.

  20. DFA parts ALPHABET: Σ = {a,b} a b b q0 q1 q2 q3 a a a b b q4 a b Exactlyone transition from every state under each symbol in the alphabet.

  21. DFA transition graph a b b q0 q1 q2 q3 a a a b b q4 a b

  22. DFA transition graph a b b q0 q1 q2 q3 a a a b b q4 a b JUNK or TRAP STATE

  23. DFA continued a b b q0 q1 q2 q3 a a a b b TAPE q4 a b

  24. DFA continued Input string: abb a b b q0 q1 q2 q3 a a a b b bba q4 a b

  25. DFA continued Input string: abb a b b q0 q1 q2 q3 a a a b a b bb q4 a b

  26. DFA continued Input string: abb a b b q0 q1 q2 q3 a a a b b bb q4 a b

  27. DFA continued Input string: abb a b b q0 q1 q2 q3 a a a b b b b q4 a b

  28. DFA continued Input string: abb a b b q0 q1 q2 q3 a a a b b b q4 a b

  29. DFA continued Input string: abb a b b q0 q1 q2 q3 a a a b b b q4 a b

  30. DFA continued Input string: abb a b b q0 q1 q2 q3 a a a b b q4 a b

  31. DFA continued Input string: abb a b b q0 q1 q2 q3 a a a b b q4 ACCEPT a b

  32. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a a b b bbba q4 a b

  33. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a a b a b bbb q4 a b

  34. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a a b b abb q4 a b

  35. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a a b b b bb q4 a b

  36. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a a b b bb q4 a b

  37. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a a b b b b q4 a b

  38. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a a b b q4 b a b

  39. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a b b a q4 b a b

  40. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a b a q4 b a b

  41. DFA continued Input string: abbb a b b q0 q1 q2 q3 a a b a q4 b REJECT a b

  42. Empty string • Denoted by the Greek letters εorλ. • Contains no letters.

  43. Empty string Input string: ε a b b q0 q1 q2 q3 a a a b b q4 a b The tape is empty

  44. Empty string Input string: ε a b b q0 q1 q2 q3 a a a b b q4 REJECT a b

  45. Other Example More than one accepting states a b b q0 q1 q2 q3 a a a b b q4 a b

  46. Other Example Input string: ε a b b q0 q1 q2 q3 a a a b b q4 a b

  47. Other Example Input string: ε a b b q0 q1 q2 q3 a a a b b q4 ACCEPT a b

  48. Other Example Input string: ε a b b q0 q1 q2 q3 a a a b b q4 ACCEPT a b • The automaton accepts with input the empty string εiff the START state is an ACCEPTING state.

  49. DFA formally • In order to completely determine a DFA we need five things: • Its set of states, • the alphabet of the input strings, • a the transition function between states, • a start statefrom which the computation begins and • the set of states for which the DFA accepts.

  50. DFA formally • A DFA M is a quintuple (Q, Σ, δ, q0, F) where a b b q0 q1 q2 q3 a a a b b q4 a b