Finite state automatons in information states
Emil Gergely Dyekiss · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · 2012
The aim of this paper is to introduce a certain kind of information state repre- sentation in a dynamic system of propositional logic, using finite state automatons and highlight its advantages, including relation to inquisitive semantics and belief revision.