finite automata
DESCRIPTION
Finite Automata. Chapter 1. Automatic Door Example. Top View. Automatic Door Example. State diagram State table. Finite Automata Markov Chain. Simple 2-state probabilistic Markov Chain. Example 1. What strings does this language “accept”. Example 1. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/1.jpg)
Finite Automata
Chapter 1
![Page 2: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/2.jpg)
Automatic Door Example
• Top View
![Page 3: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/3.jpg)
Automatic Door Example
• State diagram
• State table
![Page 4: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/4.jpg)
Finite Automata Markov Chain
• Simple 2-state probabilistic Markov Chain
![Page 5: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/5.jpg)
Example 1
• What strings does this language “accept”
![Page 6: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/6.jpg)
Example 1
• Can you describe this language using set notation or a formal description?
![Page 7: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/7.jpg)
Example 1
• This machine can be describes using set and sequence notation.
M = (Q, Ʃ, δ, S, F) Ʃ = {0, 1} Q = {q1, q2, q3} S = q1
F = {q2}δ= {(q1, 0, q1), (q1, 1, q2), (q2, 1, q2), (q2, 0, q3),
(q3, 0, q2), (q3, 1, q2)}
![Page 8: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/8.jpg)
Example 2
• What language does this describe?
![Page 9: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/9.jpg)
Example 2
• Write this automata using set and sequence notation.
![Page 10: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/10.jpg)
Question 1
• Draw this automata as a state diagram.
M = (Q, Ʃ, δ, S, F) Ʃ = {0, 1} Q = {q1, q2, q3} S = q1
F = {q3}δ= {(q1, 0, q2), (q1, 1, q1), (q2, 0, q2), (q2, 1, q3),
(q3, 0, q3), (q3, 1, q3)}
![Page 11: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/11.jpg)
Question 2
• What language does this automata “accept?”
M = (Q, Ʃ, δ, S, F) Ʃ = {0, 1} Q = {q1, q2, q3} S = q1
F = {q3}δ= {(q1, 0, q2), (q1, 1, q1), (q2, 0, q2), (q2, 1, q3),
(q3, 0, q3), (q3, 1, q3)}
![Page 12: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/12.jpg)
Question 3
• Design an automata that will only accept binary strings that end with 0.
![Page 13: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/13.jpg)
Question 4
• What language does this automata accept
![Page 14: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/14.jpg)
Question 5
• Design an automata that only accepts strings that start and end with a different symbol, assume the alphabet is {a, b}
![Page 15: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/15.jpg)
Regular Languages
![Page 16: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/16.jpg)
Regular Operations
![Page 17: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/17.jpg)
Regular Operations
• Examples
![Page 18: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/18.jpg)
Regular Operations
• Closure
![Page 19: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/19.jpg)
![Page 20: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/20.jpg)
![Page 21: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/21.jpg)
Regular Operations
• Closure
![Page 22: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/22.jpg)
![Page 23: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/23.jpg)
![Page 24: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/24.jpg)
Regular Operations
• Closure
![Page 25: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/25.jpg)
![Page 26: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/26.jpg)
![Page 27: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/27.jpg)
![Page 28: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/28.jpg)
Regular Expression Examples
![Page 29: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/29.jpg)
Regular Expression Examples
![Page 30: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/30.jpg)
Regular Expression (RE) NFA
• (ab ᴜ a)*
![Page 31: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/31.jpg)
Regular Expression (RE) NFA
• (ab ᴜ a)*
![Page 32: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/32.jpg)
Regular Expression (RE) NFA
• (a ᴜ b)*aba
![Page 33: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/33.jpg)
(a ᴜ b)*aba
![Page 34: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/34.jpg)
DFA Regular Expression (RE)
![Page 35: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/35.jpg)
DFA Regular Expression (RE)
![Page 36: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/36.jpg)
DFA Regular Expression (RE)
![Page 37: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/37.jpg)
DFA Regular Expression (RE)
![Page 38: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/38.jpg)
DFA Regular Expression (RE)
![Page 39: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/39.jpg)
DFA Regular Expression (RE)
![Page 40: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/40.jpg)
DFA Regular Expression (RE)
![Page 41: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/41.jpg)
DFA Regular Expression (RE)
![Page 42: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/42.jpg)
DFA Regular Expression (RE)
![Page 43: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/43.jpg)
DFA Regular Expression (RE)
![Page 44: Finite Automata](https://reader036.vdocuments.mx/reader036/viewer/2022062409/568148f9550346895db61d74/html5/thumbnails/44.jpg)