Dynamic logic assigned to automata
share
A dynamic logic B can be assigned to every automaton A without regard if A is deterministic or nondeterministic. This logic enables us to formulate observations on A in the form of composed propositions and, due to a transition functor T, it captures the dynamic behaviour of A. There are formulated conditions under which the automaton A can be recovered by means of B and T.
READ FULL TEXT