|
Fundamentalnaya i Prikladnaya Matematika, 1996, Volume 2, Issue 4, Pages 1163–1186
(Mi fpm179)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Oriented hypergraphs and rewriting systems
A. I. Belousova, A. V. Pastukhovskyb a N. E. Bauman Moscow State Technical University
b Scientific Research Institute of Applied Mathematics and Mechanics by N. E. Bauman Moscow State Technical University
Abstract:
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.
Received: 01.10.1995
Citation:
A. I. Belousov, A. V. Pastukhovsky, “Oriented hypergraphs and rewriting systems”, Fundam. Prikl. Mat., 2:4 (1996), 1163–1186
Linking options:
https://www.mathnet.ru/eng/fpm179 https://www.mathnet.ru/eng/fpm/v2/i4/p1163
|
Statistics & downloads: |
Abstract page: | 667 | Full-text PDF : | 438 | References: | 1 | First page: | 2 |
|