RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2003 Volume 304, Pages 128–140 (Mi znsl889)

EMSO-definability of some languages with event structures

K. V. Shahbazyan, Yu. G. Shoukourian

Institute for Informatics and Automation Problems of National Academy of Science of the Republic of Armenia

Abstract: Languages of words, trees, and pictures with related event structures are considered. An event structure is defined for a word (tree, picture) based on the event structures of individual letters and homogeneous relations between the events of letters on neighboring positions. The main problem considered is the problem of EMSO-definability of two language classes: the class of languages with cyclic event structures and the class of languages with acyclic event structures.

UDC: 510.54

Received: 22.04.2003


 English version:
Journal of Mathematical Sciences (New York), 2005, 130:2, 4624–4630

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025