Geodesic
Object-oriented dataas prefix rewriting systems
Vladikavkazskij matematičeskij žurnal, Tome 17 (2015) no. 3, pp. 23-35 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A deterministic longest-prefix rewriting system is a rewriting system such that there are no rewriting rules $X\to Y$, $X\to Z$ with $Y\ne Z$, and only longest prefixes of words are subject to rewriting. Given such a system, analogs are defined and examined of some concepts related to object-oriented data systems: inheritance of classes and objects, instances of classes, class and instance attributes, conceptual dependence and consistency, conceptual scheme, types and subtypes, etc. A special attention is paid to the effective verification of various properties of the rewriting systems under consideration. In particular, algorithms are presented for answering the following questions: Are all words finitely rewritable? Do there exist recurrent words? Is the system conceptually consistent? Given two words $X$ and $Y$, does $X$ conceptually depend on $Y$? Does the type of $X$ coincide with that of $Y$? Is the type of $X$ a subtype of that of $Y$? 
@article{VMJ_2015_17_3_a2,
     author = {A. E. Gutman},
     title = {Object-oriented dataas prefix rewriting systems},
     journal = {Vladikavkazskij matemati\v{c}eskij \v{z}urnal},
     pages = {23--35},
     year = {2015},
     volume = {17},
     number = {3},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VMJ_2015_17_3_a2/}
}
TY  - JOUR
AU  - A. E. Gutman
TI  - Object-oriented dataas prefix rewriting systems
JO  - Vladikavkazskij matematičeskij žurnal
PY  - 2015
SP  - 23
EP  - 35
VL  - 17
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VMJ_2015_17_3_a2/
LA  - en
ID  - VMJ_2015_17_3_a2
ER  - 
%0 Journal Article
%A A. E. Gutman
%T Object-oriented dataas prefix rewriting systems
%J Vladikavkazskij matematičeskij žurnal
%D 2015
%P 23-35
%V 17
%N 3
%U http://geodesic.mathdoc.fr/item/VMJ_2015_17_3_a2/
%G en
%F VMJ_2015_17_3_a2
A. E. Gutman. Object-oriented dataas prefix rewriting systems. Vladikavkazskij matematičeskij žurnal, Tome 17 (2015) no. 3, pp. 23-35. http://geodesic.mathdoc.fr/item/VMJ_2015_17_3_a2/

[1] Salomaa A., Formal Languages, Academic Press, N.Y., 1973, 336 pp. | MR | Zbl

[2] Barwise J. (ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, 1165 pp. | MR

[3] Vizing V. G., “Distributive Coloring of Graph Vertices”, Diskretn. Anal. Issled. Oper., 2:4 (1995), 3–12 | MR | Zbl