If this is fixed then the automaton is a fixed structure deterministic or a fixed structure stochastic automaton.
The idea is simply to construct an automaton like that pictured above for a specified behaviour.
The macro for automata enables a programmer to ignore this distinction, while still leaving both implementations a possibility.
Their method of dictionary storage (a minimal acyclic deterministic finite automaton) enables them to apply the substitutions and to check the results very rapidly.
This enables client programmers to choose the algorithm and the type of automata they wish to use.
It can be exactly the same as with deterministic finite automata if all possible percepts can be collected.
The resulting graphs may be employed in various ways, for example as neural networks, as automata, or as knowledge-base queries.
The dictionary can then be represented by an automaton in which final states are provided with numbers referring to these codes.
