Geodesic
Oriented hypergraphs and rewriting systems
Fundamentalʹnaâ i prikladnaâ matematika, Tome 2 (1996) no. 4, pp. 1163-1186 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The paper is dedicated to the analysis of one model of an oriented hypergraph which is presented as a special case of a semigroup rewriting system. The classification of hypergraphs is considered and for a certain hypergraph family the path enumeration algorithm is proposed. Also the one-to-one correspondence between the mentioned hypergraph family and the information systems after D. Scott is stated. 
@article{FPM_1996_2_4_a13,
     author = {A. I. Belousov and A. V. Pastukhovsky},
     title = {Oriented hypergraphs and rewriting systems},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {1163--1186},
     year = {1996},
     volume = {2},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_1996_2_4_a13/}
}
TY  - JOUR
AU  - A. I. Belousov
AU  - A. V. Pastukhovsky
TI  - Oriented hypergraphs and rewriting systems
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 1996
SP  - 1163
EP  - 1186
VL  - 2
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/FPM_1996_2_4_a13/
LA  - ru
ID  - FPM_1996_2_4_a13
ER  - 
%0 Journal Article
%A A. I. Belousov
%A A. V. Pastukhovsky
%T Oriented hypergraphs and rewriting systems
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 1996
%P 1163-1186
%V 2
%N 4
%U http://geodesic.mathdoc.fr/item/FPM_1996_2_4_a13/
%G ru
%F FPM_1996_2_4_a13
A. I. Belousov; A. V. Pastukhovsky. Oriented hypergraphs and rewriting systems. Fundamentalʹnaâ i prikladnaâ matematika, Tome 2 (1996) no. 4, pp. 1163-1186. http://geodesic.mathdoc.fr/item/FPM_1996_2_4_a13/