Rough Set Approximations of Languages
Gheorghe P checkA un, Lech Polkowski, Andrzej Skowron · Fundamenta Informaticae · 1997
We investigate here the possibility of approximating a language starting from a partial knowledge of its strings. This is understood as the possibility to read only a bounded part of a string: a prefix or a subword. In this way, indiscernibility rela