a) 10
b) 11
c) 12
d) 13
The total number of states to build the given language using DFA: L = {w | w has exactly 2 a’s and at least 2 b’s}
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
The total number of states to build the given language using DFA: L = {w | w has exactly 2 a’s and at least 2 b’s}
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!