MrPet
429
11
0
Because of the big Rona, I am at the moment very bored, thus the idea to make a post about some computer sciency stuff emerged in my brain. Because I suck at programming, I can only offer some theoretical things like simple automata theory, formal languages (regular expressions, context free grammar etc.) and/or turing machines with a bit of complexity and computability (computable vs non-computable problems) sprinkled in.
That means if yall are interested in this kinda stuff, let me know and I will deliver it hot and ready.
biscuitmodafucka
Deliver that sweet knowledge!!
igoslow
A finite state automata or finite state machine.
vatnick
MrPet
Well I wasn't there, so of course I am square.
scaryfeet10
I’m ready! Tell me about this diagram!
Undumpable
b likes q3 and a likes q4 and q5 equally
MrPet
The diagram is a senseless DFA (deterministic finite automaton).
igoslow
By golly, DFA, FSA, and FSM are all the same thing. The acronym DFA is new to me.
MrPet
A NFA (non-deterministic) could omit edges for actions/letters or have multiple edges for the same action/letter. 2/2
MrPet
The D for deterministic just means that every state has an edge for every action/letter. So that a clear walk is always possible. 1/2
MrPet
DFAs are simple, in the sense of what they can and can't express. A dfa does not have memory like a turing machine so it's not as powerfull.
igoslow
Finite state automata (FSA or FSM). I’ve created many programs based on state machines.
igoslow
I see no exit in this state machine.
MrPet
q1 is the accepting state. Finite state automata may be a more general term, they can be deterministic DFA or non-deterministic NFA.