Algebras of languages associated with labelled graphs

In this work, we introduce a family of algebras that may serve as an effective tool for characterization of languages, that can be represented by labelled graphs, and study its properties. It is proved that the language is represented by a regular expression in considered algebras if and only if this language is associated with the labelled graph. This result is an analog of well-known Kleene's theorem for finite automata.