The Σ is {l,r,u,d} where α ∈ Σ which denote the gamepad controllers (l = left, r = right, u = up and d = down) whilst Strings s, t, ... over Σ⋆ thus denote sequence of commands on the gamepad.
Have a question in regards to the following:
Assume the predicate even :: N -> B that returns true for all the even natural numbers 0, 2, 4 ... and false otherwise.
Design a DFSA M that only accepts the gamepad command language L = { s | s ∈ Σ* and even(lefts(s))}
My question is whether or not transitions can have a power or not, the transitions in M are for example l^n such that n is even.
Can this be done? If not what is the way to tackle such a question?
(ii) Besides that I would like to ask what is the difference between s ∈ L and s ∈ L(M)
TIA
