Algorithm Element as a Strong Generator Product Input: a group G operating on f = 1,2,.....n; an element g of G; a base and strong generating set for G; Schreier vectors v I 1 I k, for the stabiliser chain Output: a symbolic product, a word that expresses g in terms of the strong generators.

5. Find a closed form representation for the function defined recursively by f(0) = 5 and f(n+1)=2f(n)+4". Prove that your representation is correct using an inductive argument.

Algorithm to Element as Product of Strong GeneratorsInput : a group G acting on f~ = { 1,2 ..... n };an element g of G;a base and strong generating set for G;Schreier vectors v (i), 1 < i < k, for the stabiliser chain;Output : a symbolic product, word, expressing g in terms of the strong generators;

Review image for prompt: (Computation and Automata)

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

Write a classifier algorithm for p(Y |X,α)

Given: Language L2 = {w ε {a,b}* | w contains substring aab} Construct the DFA representing the given language L2. Assume the layout of the DFA is as follows: ->A->B->C->D*. That is, the number of states are four (4) and A is the starting state and D is the accepting state. How many self-loop edge/s in the constructed DFA representing the given language L2?