Constructing polynomials over finite fields

In this paper we present an algorithm for constructing a polynomial system corresponding to a given directed labeled graph. Three specific classes of polynomial systems are considered in detail. Then we briefly consider some desirable properties for output sequences and we show how to construct a polynomial system that will produce a given output sequence of zeros and ones of length 2^n.