FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

1996, VOLUME 2, NUMBER 4, PAGES 1163-1186

Oriented hypergraphs and rewriting systems

A. I. Belousov
A. V. Pastukhovsky

Abstract

View as HTML     View as gif image

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.

Location: http://mech.math.msu.su/~fpm/eng/96/964/96413h.htm
Last modified: March 19, 2005