Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Rough Approximations in Varieties of Regular Languages

Martin G., Steinby M.

Fundamenta Informaticae

2011

Vol. 112, nr 4

281-303

We study approximations of regular languages bymembers of a given variety L of regular languages. These are upper or lower approximations in the sense of Pawlak’s rough set theory with respect to congruences belonging to the variety of congruences corresponding to L. In particular, we consider the closest upper and lower approximations in L. In so-called principal varieties these always exist, and we present algorithms for finding them, but for other varieties the situation is more complex. Although we consider just Eilenberg’s +-varieties, the general ideas apply also to other types of varieties of languages. Our work may also be viewed as an approach to the characterizable inference problem in which a language of a certain kind is to be inferred from a given sample.

Traps, cores, extensions and subdirect decompositions of unary algebras

Bogdanović S., Ćirić M., Petković T., Imreh B., Steinby M.

Fundamenta Informaticae

1999

Vol. 38, Nr 1,2

51-60

Subdirect decompositions of unary algebras are studied in connection with one-element subalgebras, cores, Rees extensions of congruences of subalgebras, dense extensions and disjunctive elements. In particular, subdirectly irreducible unary algebras are described in terms of these notions.