Design a DFA that accepts a string having at least 3 b's and at most 2 a's and prove your solution with 2 accepted and 2
Posted: Thu Jun 02, 2022 8:26 am
Design a DFA that accepts a string having at
least 3 b's and at most 2 a's and prove your solution with 2
accepted and 2 rejected examples,
least 3 b's and at most 2 a's and prove your solution with 2
accepted and 2 rejected examples,