Seminar of Theoretical Computer Science - Šimon Sádovský (26.10.2018)

Friday 26.10.2018 at 11:00, Lecture room M/213

---

Šimon Sádovský:
On Usefulness of Information: Framework and NFA Case

Abstract:
In the presentation 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. We briefly sketch some possibilities of the extension of our resarch.

 

web: http://kedrigern.dcs.fmph.uniba.sk/STI2 
rss: http://kedrigern.dcs.fmph.uniba.sk/STI2/rss.php

---