Abstract:
A general case of automaton system of interconnected graphs with connected states is described. Behaviour of such systems is described. Two systems are shown to be equivalent if the associated sets of superdense words are equal. Particular cases of systems are identified whose analysis by using superdense words is most effective.
Fulltext:
PDF file (1653 kB)