Problem 2 (35 points). Give the state diagram of an NFA that accepts the set of all strings over Σ = {a,b} that contain
Posted: Thu May 26, 2022 9:23 am
by answerhappygod
1 (20.37 KiB) Viewed 13 times
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.