- 1 (20.37 KiB) Viewed 12 times
Problem 2 (35 points). Give the state diagram of an NFA that accepts the set of all strings over Σ = {a,b} that contain
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Problem 2 (35 points). Give the state diagram of an NFA that accepts the set of all strings over Σ = {a,b} that contain
Problem 2 (35 points). Give the state diagram of an NFA that accepts the set of all strings over Σ = {a,b} that contain at least 3 occurrences of 2 consecutive b's, overlapping permitted. For example, bbbb, abbabbb, bbabbabbabbaa, bbaababbaaabb should be accepted.