draw DFA
part2:
end of question
Which regular expression describes the language L over the alphabet {a,b}. L=Language of all words with odd number of a's. b*a(b+ab*a)* a(aa)*+b* b*a(aa)*b* O (b*ab*ab*ab*)* Moving to the next question prevents changes to this answer
Question #3: Draw FA, +FA, and FA, FA, for the following. (3+4 marks) FAI + a 6 # FA る FA+FAZ +
Which regular expression describes the language L over the alphabet {a,b}. L=Language of all words with odd number of a'
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which regular expression describes the language L over the alphabet {a,b}. L=Language of all words with odd number of a'
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!