|
Zapiski Nauchnykh Seminarov 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.
Received: 22.04.2003
Citation:
K. V. Shahbazyan, Yu. G. Shoukourian, “EMSO-definability of some languages with event structures”, Computational complexity theory. Part VIII, Zap. Nauchn. Sem. POMI, 304, POMI, St. Petersburg, 2003, 128–140; J. Math. Sci. (N. Y.), 130:2 (2005), 4624–4630
Linking options:
https://www.mathnet.ru/eng/znsl889 https://www.mathnet.ru/eng/znsl/v304/p128
|
Statistics & downloads: |
Abstract page: | 180 | Full-text PDF : | 53 | References: | 31 |
|