In this paper we present a brief overview of the results of our research aimed at identifying and formalising various aspects of the notion of information, especially its usefulness, i.e., its ability to simplify a solution of a problem. We formalize the problem via decompositions of automata and present new results in the nondeterministic finite automata setting. We characterise some subfamilies of regular languages that are nondeterministically decomposable/undecomposable and exhibit an infinite sequence of regular languages that are nondeterministically undecomposable but decomposable in the deterministic finite automata setting.
CITATION STYLE
Rovan, B., & Sádovský, Š. (2018). On usefulness of information: Framework and NFA case. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11011 LNCS, pp. 85–99). Springer Verlag. https://doi.org/10.1007/978-3-319-98355-4_6
Mendeley helps you to discover research relevant for your work.