Oriented hypergraphs and rewriting systems

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.