Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Select your language


Взаємозв’язок алгебр мов, що можуть бути представлені в помічених графах

Pryanichnikova E.1
1 Державний університет інформатики і штучного інтелекту

Full text (PDF)

UDC: 519.6
Publication Language: Russian
Stuc. intelekt. 2010; 15(4):453-459

Abstract: In this paper we study an algebra of languages that can be represented by vertex-labeled graphs. We establish some new relationships between this algebra and the algebra of regular languages. It is proved that these studied algebras have isomorphic sub algebras. We show that it is always possible to transform regular expression of Kleene algebra into a regular expression of algebra of languages that can be represented by vertex-labeled graphs without changing its language. It is shown that algebra of languages that can be represented by vertex-labeled graphs is not the Kleene algebra.

Keywords:

References:

View full text (PDF)