Skip to main content
Log in

EMSO-Definability of Some Languages with Event Structures

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

Languages of words, trees, and pictures with related event structures are considered. An event structure is defined for a word (tree, picture) from 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. Bibliography: 5 titles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. G. Winskel and M. Nielsen, Models for Concurrency (Handbook of Logic in Computer Science, 4), Oxford University Press (1995).

  2. K. V. Shakhbazyan and Yu. G. Shoukourian, “Logically definable languages of computations in one class of flow event structures,” Rep. Nat. Acad. Sci. Armenia, 102, No.1, 16–22 (2002).

    Google Scholar 

  3. W. Thomas, “Languages, automata, and logic,” in: Handbook of Formal Languages, Vol. III, G. Rozenberg and A. Salomaa (eds.), Springer-Verlag (1997), pp. 389–455.

  4. D. Giammarresi and A. Restivo, Two-Dimensional Languages (Formal Language Theory, Vol. III), Springer-Verlag, New York (1996).

    Google Scholar 

  5. W. Thomas, “Languages, automata, and logic,” Bericht 9607, Institute fur Informatik und praktische Mathematik der Christian-Albrechts-Universitat zu Kiel, D-24098, Kiel.

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Published in Zapiski Nauchnykh Seminarov POMI, Vol. 304, 2003, pp. 128–140.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shahbazyan, K.V., Shoukourian, Y.G. EMSO-Definability of Some Languages with Event Structures. J Math Sci 130, 4624–4630 (2005). https://doi.org/10.1007/s10958-005-0357-y

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-005-0357-y

Keywords

Navigation