Build a DFA and TG that accepts all those strings that have an ‘odd number of a’s’ but ‘any number of b’s’. DFA (deterministic Finite Automata) TG (Transition Graph) Theory of autometa

Design an Algorithms (psuedo c++) An algorithm that solves subsetsum problem by brute force

For each of the following regular expressions over Σ = {a, b}, state 5 strings that are in the language of the regular expression, and 5 strings that are not.  1. (a∗b)∗|a∗2. (Σ∗aaΣ∗)|(Σ∗bbΣ∗)|(ab)∗|(ba)∗|a|b

55. Find a deterministic finite-state automaton that recog- nizes each of these sets. b) {1, 00} a) {0} c) {1" | n = 2, 3, 4, ...} 56. Find a nondeterministic finite-state automaton that recog- nizes each of the languages in Exercise 55, and has fewer states, if possible, than the deterministic automaton you found in that exercise.