Dynamic logic assigned to automata

Abstract

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

12 pages. arXiv admin note: text overlap with arXiv:1510.02972

References in corpus (2)

• Free quantum field theory from quantum cellular automata: derivation of Weyl, Dirac and Maxwell quantum cellular automata
• Transition operators assigned to physical systems