- 1 (37.7 KiB) Viewed 31 times
2) (5 pts) Suppose that a bank only permits passwords that are strings from the alphabet Σ = {a, b, c, d, 1, 2, 3, !, ?,
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
2) (5 pts) Suppose that a bank only permits passwords that are strings from the alphabet Σ = {a, b, c, d, 1, 2, 3, !, ?,
2) (5 pts) Suppose that a bank only permits passwords that are strings from the alphabet Σ = {a, b, c, d, 1, 2, 3, !, ?, $) that follow the rules: • • The length is at least four characters. It begins with a letter (a, b, c, d). Must contain at least one digit {1, 2, 3). Must end with a "special character" {!, ?, $}. 22a! b1? bb1?1 abab bbb? a1c? a?2? a???1? MUZ Reject Reject Reject Reject Reject Accept Accept Accept The set of legal passwords forms a regular language L. Construct an NFA or DFA for L. The table above contains some sample test cases.