Just finished my new sig. :cool:
Printable View
Just finished my new sig. :cool:
:cool::cool:
Off to sleep
Trying some mobile games! :whistle:
Watching The Cube.
PC modding. Got a good feeling about this. :whee:
Success! :whee:
Except, the text on M24 is a light grey now.. :(
Listening to Exodu's newest album! :wow:
Trying to understand regular expressions, NFAs and DFAs. :blink:
Not successful so far.
Downloading some torrents. :whistle:
Going to sleep! :wave:
Watching Louis Theroux.
Watching looking for eric
Oh that's easy Vivian
An NFA, similar to a DFA, consumes a string of input symbols. For each input symbol it transitions to a new state until all input symbols have been consumed.
Unlike a DFA, it is non-deterministic in that, for any input symbol, its next state may be any one of several possible states. Thus, in the formal definition, the next state is an element of the power set of states. This element, itself a set, represents some subset of all possible states to be considered at once.
An extension of the NFA is the NFA-lambda (also known as NFA-epsilon or the NFA with epsilon moves), which allows a transformation to a new state without consuming any input symbols. For example, if it is in state 1, with the next input symbol an a, it can move to state 2 without consuming any input symbols, and thus there is an ambiguity: is the system in state 1, or state 2, before consuming the letter a? Because of this ambiguity, it is more convenient to talk of the set of possible states the system may be in. Thus, before consuming letter a, the NFA-epsilon may be in any one of the states out of the set {1,2}. Equivalently, one may imagine that the NFA is in state 1 and 2 'at the same time': and this gives an informal hint of the powerset construction: the DFA equivalent to an NFA is defined as the one that is in the state q={1,2}. Transformations to new states without consuming an input symbol are called lambda transitions or epsilon transitions. They are usually labeled with the Greek letter λ or ε.
The notion of accepting an input is similar to that for the DFA. When the last input symbol is consumed, the NFA accepts if and only if there is some set of transitions that will take it to an accepting state. Equivalently, it rejects, if, no matter what transitions are applied, it would not end in an accepting state.
:blink:
Downloading some of the Total War games.
Watching TV and enjoying relaxing Sunday afternoon :)
Studying, have exam tomorrow!:surrender:
Going to work
Waking up.
:thumbsup:
Removing signatures that are the size of an entire page :blink:
Ok maybe not that big.:laugh:
But too big.
Just woke up...
Morning all.
Waiting for emails
Much.
People can be so time consuming
Watching my Tiger Whiptails wake up.
Looking for a new wallpaper.
Thinking of getting a new game.
Making wallpapers.
The kind that I can only make when the boss steps out. :laugh:
Reading some books about PhotoShop.
:laugh::laugh::laugh::laugh::laugh::laugh: