- 2 10 Points Construct Deterministic Finite Automaton Accepting The Language W E A B W Has An Odd Number Of A S A 1 (50.89 KiB) Viewed 44 times
2. (10 points) Construct deterministic finite automaton accepting the language {w E{a,b}* : w has an odd number of a's a
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
2. (10 points) Construct deterministic finite automaton accepting the language {w E{a,b}* : w has an odd number of a's a
2. (10 points) Construct deterministic finite automaton accepting the language {w E{a,b}* : w has an odd number of a's and an odd number of b's }. Use state diagram to represent your deterministic finite automaton. Justify your construction.