Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: prelanguage

Sortuj według:

Ogranicz wyniki do:

Prelanguages versus submonoids

Ostravsky J.

Fundamenta Informaticae

2001

Vol. 46, nr 4

343-348

In [9] submonoids of a commutative monoid are characterized by means of their relations of domination, subgroups of a commutative monoid are characterized by means of their relations of double domination. The main purpose of this paper is to transfer these results to general monoids. The important means will be certain relations, which we shall study in detail.

Reduction of pregrammars

Novotny M.

Fundamenta Informaticae

1998

Vol. 33, nr 3

295-307

In pure generalized grammars were studied, in particular, the problem of reducing a pure generalized grammar to a pure grammar. These results are transferred to the so called pregrammars in the present paper. The obtained results may be applied not only to pure generalized grammars but also to other structures.

Pregrammars versus submonoids

Ostravsky J.

Fundamenta Informaticae

1998

Vol. 36, nr 4

337-343

Prelanguages and pregrammars introduced present a generalization of languages and pure grammars. Relation of domination and double domination may be easily transferred from languages to prelanguages. In the present paper submonoids of a commutative monoid are characterized by means of their relations of domination: subgroups of a commutative group are characterized by means of their relations of double domination. The submonoid generated by a subset of a commutative monoid is constructed using a suitable pregrammar.